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

DOI10.1007/3-540-45471-3_40MaRDI QIDQ3046514zbMATH OpenOpenAlexFDO

Authors 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

Algorithms and data structuresgraph algorithmsminimal separatorsminimum fill-inmodular decompositiontreewidth

Mathematics Subject Classification ID

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

Recommendations

• Computing the treewidth and the minimum fill-in with the modular decomposition
• scientific article; zbMATH DE number 1262810
• Minimum size tree-decompositions
• Exact Algorithms for Treewidth and Minimum Fill-In
• Automata, Languages and Programming

Cited in

(6)

• Computing the treewidth and the minimum fill-in with the modular decomposition
• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
• Efficient computation of the modular chromatic numbers of trees
• scientific article; zbMATH DE number 1262810 (Why is no real title available?)
• Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
• Automata, Languages and Programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046514)