Obtaining a planar graph by vertex deletion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4769 LNCS, Issue , 2007, Pages 292-303

  Marx, Dániel ^a   Schlotter, Ildikó ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; NUMERICAL METHODS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

PLANAR GRAPHS; TREEWIDTH; VERTEX DELETION;

GRAPH THEORY;

EID: 38549090020     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74839-7_28     Document Type: Conference Paper

References (20)

1. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153-180 (1994)
2. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305-1317 (1996)
3. Cai, L.: Fixed-parameter treatability of graph modification problems for hereditary properties. Inform. Process. Lett. 58, 171-176 (1996)
4. Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Handbook of Theoretical Computer Science, vol. 2, pp. 194-242. Elsevier, Amsterdam (1990)
5. Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of graph grammars and computing by graph transformations, ch. 5, vol. 1, pp. 313-400. World Scientific, New-Jersey (1997)
6. Diestel, R.: Graph Theory. Springer, Berlin (2000)
7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
8. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3, 1-27 (1999)
9. Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. J. ACM 49, 716-752 (2002)
10. Garey, M.R., Johnson, D.S.: Crossing Number is NP-Complete. SIAM J. Algebraic Discrete Methods 4, 312-316 (1983)
11. Grohe, M.: Computing crossing number in quadratic time. J. Comput. System Sci. 68, 285-302 (2004)
12. Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4, 221-225 (1975)
13. Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM 21, 549-568 (1974)
14. Lewis, J.M., Yannakakis, M.: The vertex-deletion problem for hereditary properties is NP-complete. J. Comput. System Sci. 20, 219-230 (1980)
15. Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9, 615-627 (1980)
16. Perkovic, L., Reed, B.: An improved algorithm for finding tree decompositions of small width. Internat. J. Found. Comput. Sci. 11, 365-371 (2000)
17. Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Combin. Theory Ser. B 62, 323-348 (1994)
18. Robertson, N., Seymour, P.D.: Graph minors. J. Combin. Theory Ser. B 92, 325-357 (2004)
19. Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 63, 65-110 (1995)
20. Thomassen, C.: The graph genus problem is NP-complete. J. Algorithms 10, 568-576 (1989)