Treewidth Computation and Extremal Combinatorics
From MaRDI portal
Publication:3521920
DOI10.1007/978-3-540-70575-8_18zbMath1152.05376arXiv0803.1321OpenAlexW1542253039WikidataQ60488753 ScholiaQ60488753MaRDI QIDQ3521920
Yngve Villanger, Fedor V. Fomin
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
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Treewidth computation and extremal combinatorics ⋮ Computing hypergraph width measures exactly ⋮ Feedback Vertex Sets in Tournaments ⋮ Faster parameterized algorithms for \textsc{Minimum Fill-in} ⋮ Solving Graph Problems via Potential Maximal Cliques ⋮ Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} ⋮ On the complexity of computing treelength ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Unnamed Item
This page was built for publication: Treewidth Computation and Extremal Combinatorics
