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

DOI10.1007/3-540-45471-3_40zbMath1078.68672OpenAlexW2153209610MaRDI QIDQ3046514

Hans L. Bodlaender, Udi Rotics

Publication date: 12 August 2004

Published in: Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL: http://dspace.library.uu.nl/handle/1874/23972

zbMATH Keywords

treewidthgraph algorithmsmodular decompositionminimal separatorsminimum fill-inAlgorithms and data structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width

This page was built for publication: Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition