82 citations · 167 across the 5 of their papers we have counts for
1 paper · 2 filters
Ann Becker, Dan Geiger
An algorithm is developed for finding a close to optimal junction tree of a given graph G. The algorithm has a worst case complexity O(c^k n^a) where a and c are constants, n is th…