Domino Treewidth

DOI10.1006/jagm.1996.0854zbMath0882.68106OpenAlexW2912205465MaRDI QIDQ4349700

Hans L. Bodlaender, Joost Engelfriet

Publication date: 25 August 1997

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/09f363de5c8156636b06e6cc5c0571154adb0618

zbMATH Keywords

domino treewidth

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

Online promise problems with online width metrics ⋮ \(W[2\)-hardness of precedence constrained \(K\)-processor scheduling] ⋮ On the model-checking of monadic second-order formulas with edge set quantifications ⋮ Algorithms for graphs with small octopus ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Orthogonal Tree Decompositions of Graphs ⋮ GETGRATS ⋮ Logical aspects of Cayley-graphs: the group case ⋮ On tree-partition-width ⋮ A partial k-arboretum of graphs with bounded treewidth

This page was built for publication: Domino Treewidth