Ann Becker Dan Geiger A sufficiently fast algorithm for finding close to optimal clique trees. 3-17 2001 125 Artif. Intell. 1-2 db/journals/ai/ai125.html#BeckerG01 http://dx.doi.org/10.1016/S0004-3702(00)00075-8