Domino treewidth
From MaRDI portal
Publication:6184351
DOI10.1007/3-540-59071-4_33zbMath1528.68272OpenAlexW2999506470MaRDI QIDQ6184351
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
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Context-free graph languages of bounded degree are generated by apex graph grammars
- The parameterized complexity of sequence alignment and consensus
- Beyond NP-completeness for problems of bounded width (extended abstract)
- Complexity of Finding Embeddings in a k-Tree
- Fixed-Parameter Tractability and Completeness I: Basic Results
- A linear time algorithm for finding tree-decompositions of small treewidth
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Domino treewidth
