A linear time algorithm for finding tree-decompositions of small treewidth

No abstract is available in the live database for this paper.

Authors

• Hans L. Bodlaender

Keywords

• graph algorithms
• graph minors
• partial k -trees
• pathwidth
• treewidth