Treewidth Computation and Extremal Combinatorics
From MaRDI portal
Publication:3521920
DOI10.1007/978-3-540-70575-8_18zbMath1152.05376arXiv0803.1321WikidataQ60488753 ScholiaQ60488753MaRDI QIDQ3521920
Fedor V. Fomin, Yngve Villanger
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.1321
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
