Algorithms for finding an induced cycle in planar graphs and bounded genus graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 1146-1155

  Kobayashi, Yusuke ^a   Kawarabayashi, Ken Ichi ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

BOUNDED-GENUS GRAPHS; DISJOINT PATHS PROBLEM; FIXED SURFACES; LINEAR-TIME ALGORITHMS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; TIME ALGORITHMS; TIME COMPLEXITY;

GRAPH THEORY;

EID: 70349105487     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.124     Document Type: Conference Paper

References (29)

1. S. Arnborg and A. Proskurowski: Linear time algorithms for NP-hard problems restricted to partial k-trees, Disc. Appl. Math., 23 (1989), pp. 11-24.
2. D. Bienstock: On the complexity of testing for even holes and induced odd paths, Disc Math., 90 (1991), pp. 85-92.
3. See also Corrigendum by B. Reed, Disc. Math., 102 (1992), p. 109.
4. H. L. Bodlaender: A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Computing, 25 (1996), pp. 1305-1317.
5. M. Chudnovsky, G. Cornuéjols, X. Liu, P. D. Seymour and K. Vuskovic: Recognizing Berge graphs, Combinatorica, 25 (2005), pp. 143-186.
6. M. Chudnovsky, K. Kawarabayashi and P. D. Seymour: Detecting even holes, J. Graph Theory, 48 (2005), pp. 85-111.
7. M. Chudnovsky, N. Robertson, P. D. Seymour and R. Thomas: The strong perfect graph theorem, Ann. of Math., 64 (2006), pp. 51-219.
8. G. Cornuéjols, M. Conforti, A. Kapoor and K. Vusksvic: Even-hole-free graphs. I. Decomposition theorem, J. Graph Theory, 39 (2002), pp. 6-49.
9. G. Cornuéjols, M. Conforti, A. Kapoor and K. Vusksvic: Even-hole-free graphs. II. Recognition algorithm, J. Graph Theory, 40 (2002), pp. 238-266.
10. E. D. Demaine, F. V. Fomin, M. Hajiaghayi and D. M. Thilikos: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs, J. ACM, 52 (2005), pp. 866-893. (Pubitemid 43906506)
11. J. Erickson and S. Har-Peled: Optimally cutting a surface into a disk, Discrete and Computational Geometry, 31 (2004), pp. 37-59.
12. Conference version in Proc. 18th Annual ACM Symposium on Computational Geometry, 2002, pp. 244-253.
13. M. R. Fellows: The Robertson-Seymour Theorems: a survey of applications, Contemporary Mathematics 89, American Mathematical Society, 1987, pp. 1-18.
14. M. R. Fellows, J. Kratochvil, M. Middendorf and F. Pfeiffer: The complexity of induced minors and related problems, Algorithmica, 13 (1995), pp. 266-282.
15. K. Kawarabayashi and Y. Kobayashi: A linear time algorithm for the induced disjoint paths problem in planar graphs, manuscript.
16. K. Kawarabayashi and Y. Kobayashi: The induced disjoint paths problem, Proc the 13th Integer Programming and Combinatorial Optimization (LNCS 5035), 2008, pp. 47-61.
17. K. Kawarabayashi and B. Mohar: Graph and map isomorphism and all polyhedral embeddings in linear time, Proc. the 40th Annual ACM Symposium on Theory of Computing, 2008, pp. 471-480.
18. Y. Kobayashi: An extension of the disjoint paths problem, METR 2007-14, Department of Mathematical Informatics, University of Tokyo (2006).
19. B. Lévêque, D. Lin, F. Maffray and N. Trotignon: Detecting induced subgraphs, Disc Appl. Math., to appear.
20. C. McDiarmid, B. Reed, A. Schrijver and B. Shepherd: Induced circuits in planar graphs, J. Combin. Theory Ser. B, 60 (1994), pp. 169-176.
21. B. Mohar and C. Thomassen: Graphs on Surfaces, The Johns Hopkins University Press, Baltimore and London, 2001.
22. B. Reed: Rooted routing in the plane, Disc. Appl. Math., 57 (1995), pp. 213-227.
23. B. A. Reed, N. Robertson, A. Schrijver and P. D. Seymour: Finding disjoint trees in planar graphs in linear time, Contemporary Mathematics 147, American Mathematical Society, 1993, pp. 295-301.
24. N. Robertson and P. D. Seymour: Graph minors. VII. Disjoint paths on a surface, J. Combin. Theory Ser. B, 45 (1988), pp. 212-254.
25. N. Robertson and P. D. Seymour: Graph minors. XI. Circuits on a surface, J. Combin. Theory Ser. B, 60 (1994), pp. 72-106.
26. N. Robertson and P. D. Seymour: Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B, 63 (1995), pp. 65-110.
27. N. Robertson and P. D. Seymour: Graph minors. XXII. Irrelevant vertices in linkage problems, manuscript.
28. N. Robertson, P. D. Seymour and R. Thomas: Quickly excluding a planar graph, J. Combin. Theory Ser. B, 62 (1994), pp. 323-348.
29. C. Thomassen: A simpler proof of the excluded minor theorem for higher surfaces, J. Combin. Theory Ser. B, 70 (1997), pp. 306-311. (Pubitemid 127345196)