![]() |
@article{DBLP:journals/ai/BeckerG01,
author = {Ann Becker and
Dan Geiger},
title = {A sufficiently fast algorithm for finding close to optimal
clique trees},
journal = {Artif. Intell.},
volume = {125},
number = {1-2},
year = {2001},
pages = {3-17},
ee = {http://dx.doi.org/10.1016/S0004-3702(00)00075-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2003-11-19 by Michael Ley (ley@uni-trier.de)