%0 Journal Article %1 journals/ai/BeckerG01 %A Becker, Ann %A Geiger, Dan %D 2001 %J Artif. Intell. %K dblp %N 1-2 %P 3-17 %T A sufficiently fast algorithm for finding close to optimal clique trees. %U http://dblp.uni-trier.de/db/journals/ai/ai125.html#BeckerG01 %V 125

@article{journals/ai/BeckerG01, added-at = {2003-11-19T00:00:00.000+0100}, author = {Becker, Ann and Geiger, Dan}, biburl = {https://www.bibsonomy.org/bibtex/2d63ba755ab1aaf2212bc3e116693ae95/dblp}, date = {2003-11-19}, description = {dblp}, ee = {http://dx.doi.org/10.1016/S0004-3702(00)00075-8}, interhash = {a088881593db57915d7e401e9022ae21}, intrahash = {d63ba755ab1aaf2212bc3e116693ae95}, journal = {Artif. Intell.}, keywords = {dblp}, number = {1-2}, pages = {3-17}, timestamp = {2003-11-19T00:00:00.000+0100}, title = {A sufficiently fast algorithm for finding close to optimal clique trees.}, url = {http://dblp.uni-trier.de/db/journals/ai/ai125.html#BeckerG01}, volume = 125, year = 2001 }