Abstract

Several intractable (e.g. NP-complete) graph problems can be solved efficiently with help of junction trees without large bags. Graph parameters that measure the suitability of a junction tree include the well known notion of Treewidth, and the related notions of Pathwidth and Treecost. In this thesis, exact algorithms to compute
... read more