Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm

DOI10.1007/11682462_37zbMath1145.05320OpenAlexW1491923116MaRDI QIDQ3525775

Frederic Dorn, Jan Arne Telle

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_37

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Deterministic Algorithms for the Independent Feedback Vertex Set Problem ⋮ How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms ⋮ Dynamic programming and planarity: improved tree-decomposition based algorithms

This page was built for publication: Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm