Faster parameterized algorithms for minor containment
- 25 November 2011
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 412 (50), 7018-7028
- https://doi.org/10.1016/j.tcs.2011.09.015
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The disjoint paths problem in quadratic timeJournal of Combinatorial Theory, Series B, 2011
- Slightly Superexponential Parameterized ProblemsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2011
- Hadwiger's conjecture is decidablePublished by Association for Computing Machinery (ACM) ,2009
- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut DecompositionsAlgorithmica, 2009
- Subexponential parameterized algorithmsComputer Science Review, 2008
- Algorithmic Graph Minor Theory: Decomposition, Approximation, and ColoringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphsJournal of the ACM, 2005
- Branch decompositions and minor containmentNetworks, 2003
- Subgraph Isomorphism in Planar Graphs and Related ProblemsJournal of Graph Algorithms and Applications, 1999
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988