STACS 2004
From MaRDI portal
Publication:5309687
DOI10.1007/b96012zbMath1122.68480OpenAlexW4236485840MaRDI QIDQ5309687
Dimitrios M. Thilikos, Fedor V. Fomin
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size ⋮ A combinatorial optimization algorithm for solving the branchwidth problem ⋮ Unnamed Item ⋮ Branchwidth of chordal graphs ⋮ Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm ⋮ New upper bounds on the decomposability of planar graphs ⋮ Pathwidth of cubic graphs and exact algorithms ⋮ A refined search tree technique for dominating set on planar graphs ⋮ Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth ⋮ Exact algorithms for intervalizing coloured graphs
This page was built for publication: STACS 2004
