Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.68490OpenAlexW2501059503MaRDI QIDQ5475849

Alexander Grigoriev, Arie M. C. A. Koster, Hans L. Bodlaender

Publication date: 27 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Achievable sets, brambles, and sparse treewidth obstructions ⋮ On the maximum cardinality search lower bound for treewidth

This page was built for publication: Algorithms – ESA 2005