Domino treewidth

DOI10.1007/3-540-59071-4_33MaRDI QIDQ6184351zbMATH OpenOpenAlexFDO

Authors Hans L. Bodlaender, Joost Engelfriet

Publication date 5 January 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59071-4_33

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Domino Treewidth
• scientific article; zbMATH DE number 1375581
• Dominoes
• scientific article; zbMATH DE number 4060712

Cites work

• scientific article; zbMATH DE number 3917707 (Why is no real title available?)
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 512804 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• A linear time algorithm for finding tree-decompositions of small treewidth
• Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
• Complexity of Finding Embeddings in a k-Tree
• Context-free graph languages of bounded degree are generated by apex graph grammars
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• The parameterized complexity of sequence alignment and consensus

Cited in

(2)

• Dominoes
• Domino Treewidth

This page was built for publication: Domino treewidth

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