Abstract

Using the notion of modular decomposition we extend the class of
graphs on which both the TREEWIDTH and the MINIMUM-FILL-
IN problems can be solved in polynomial time. We show that if C is
a class of graphs which is modularly decomposable into graphs that
have a polynomial number of minimal separators, or graphs
... read more