Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs

Authors:
Elias Dahlhaus
Affiliations:
-
Venue:
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1998

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
Discovering treewidth

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract