Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs

Authors:
Hajo Broersma;Elias Dahlhaus;Ton Kloks
Affiliations:
-;-;-
Venue:
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1997

Citing 0
Cited 2

Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Treewidth and minimum fill-in of weakly triangulated graphs

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract