May 2003
Intermediate to advanced
480 pages
14h 1m
English
Everything should be made as simple as possible, but not one bit simpler.
Albert Einstein (attributed)
As noted in Chapters 4 and 8, topological characterization of tractable classes is centered on the graph parameter called induced width or tree width. In this chapter, we provide related schemes that are based on the notion of tree decompositions. These methods are applicable across a wide variety of tasks, not exclusively to constraint processing, and have received different names in different research areas, such as join-tree clustering, clique-tree clustering and hypertree decompositions. We will refer to these schemes by the umbrella term tree-clustering. The complexity of these methods is governed ...
Read now
Unlock full access