Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs

DOI10.1007/978-3-642-15155-2_56zbMath1287.68183MaRDI QIDQ3586119

Siamak Tazari

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_56

zbMATH Keywords

graph minors; subexponential algorithms; odd minors

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C83: Graph minors

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

Related Items

Unnamed Item, Confronting intractability via parameters