Fixed-Parameter Tractability and Characterizations of Small Special Treewidth

DOI10.1007/978-3-642-45043-3_9zbMath1400.05234OpenAlexW152960333WikidataQ59567506 ScholiaQ59567506MaRDI QIDQ2864293

Vincent J. C. Kreuzen, Stefan Kratsch, Hans L. Bodlaender

Publication date: 6 December 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Characterizing width two for variants of treewidth ⋮ From tree-decompositions to clique-width terms

This page was built for publication: Fixed-Parameter Tractability and Characterizations of Small Special Treewidth