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

Elias Dahlhaus. Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. In Juraj Hromkovic, Ondrej Sýkora, editors, Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG 98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings. Volume 1517 of Lecture Notes in Computer Science, pages 351-358, Springer, 1998.

Abstract

Abstract is missing.