Quickly deciding minor-closed parameters in general graphs

European Journal of Combinatorics

Volumn 28, Issue 1, 2007, Pages 311-314

  Demaine, Erik D ^a   Hajiaghayi, MohammadTaghi ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748895545     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2005.07.003     Document Type: Article

References (13)

1. Robertson N., and Seymour P.D. Graph minors. XII. Distance on a surface. Journal of Combinatorial Theory, Series B 64 2 (1995) 240-272
2. Robertson N., and Seymour P.D. Graph minors. XX. Wagner's conjecture. Journal of Combinatorial Theory, Series B 92 2 (2004) 325-357
3. Frick M., and Grohe M. Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM 48 6 (2001) 1184-1206
4. Fellows M.R., and Langston M.A. Nonconstructive tools for proving polynomial-time decidability. Journal of the ACM 35 3 (1988) 727-739
5. Friedman H., Robertson N., and Seymour P. The metamathematics of the graph minor theorem. Logic and Combinatorics. Contemp. Math. vol. 65 (1987), Amer. Math. Soc., Providence, RI 229-261
6. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer-Verlag
7. Courcelle B. Graph rewriting: an algebraic and logic approach. Handbook of Theoretical Computer Science vol. B (1990), Elsevier, Amsterdam 193-242
8. Robertson N., Seymour P.D., and Thomas R. Quickly excluding a planar graph. Journal of Combinatorial Theory, Series B 62 2 (1994) 323-348
9. E. Amir, Efficient approximation for triangulation of minimum treewidth, in: Proc. 17th Conf. Uncertainty in Artificial Intelligence, 2001, pp. 7-15
10. Robertson N., and Seymour P.D. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B 63 1 (1995) 65-110
11. E.D. Demaine, F.V. Fomin, M. Hajiaghayi, D.M. Thilikos, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, in: Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, 2004, pp. 823-832
12. Demaine E.D., Fomin F.V., Hajiaghayi M., and Thilikos D.M. Bidimensional parameters and local treewidth. SIAM Journal on Discrete Mathematics 18 3 (2004) 501-511
13. E.D. Demaine, M. Hajiaghayi, Bidimensionality: New connections between FPT algorithms and PTASs, in: Proc. 16th Ann. ACM-SIAM Sympos. Discrete Algorithms, Vancouver, 2005, pp. 590-601