Treewidth computation and extremal combinatorics
From MaRDI portal
Publication:2392037
DOI10.1007/s00493-012-2536-zzbMath1289.05447MaRDI QIDQ2392037
Fedor V. Fomin, Yngve Villanger
Publication date: 6 August 2013
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-012-2536-z
graph algorithm; treewidth; exact algorithm; minimal separator; exponential-time algorithm; potential maximal clique
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
