70 citations · 466 across the 20 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012
On finding minimal w-cutset
Bozhena Bidyuk, Rina Dechter
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subse…
cs.DS2012
A Complete Anytime Algorithm for Treewidth
Vibhav Gogate, Rina Dechter
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect e…