On the Complexity of Computing Treelength

DOI10.1007/978-3-540-74456-6_26zbMath1147.68535OpenAlexW1770127481MaRDI QIDQ3525576

Daniel Lokshtanov

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Differential geometric treewidth estimation in adiabatic quantum computation ⋮ Treewidth computation and extremal combinatorics ⋮ A revisit of the scheme for computing treewidth and minimum fill-in ⋮ Tree-length equals branch-length ⋮ Tree decompositions and social graphs

This page was built for publication: On the Complexity of Computing Treelength