Abstract
We use the notion of potential maximal clique to characterize the maximal cliques appearing in minimal triangulations of a graph. We show that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum fill-in are polynomially tractable for these graphs. Finally we show how to compute in polynomial time the potential maximal cliques of weakly triangulated graphs.
Cite
CITATION STYLE
Bouchitté, V., & Todinca, I. (1999). Treewidth and minimum fill-in of weakly triangulated graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1563, pp. 197–206). Springer Verlag. https://doi.org/10.1007/3-540-49116-3_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
