A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 771-780

  Kawarabayashi, Ken Ichi ^a   Mohar, Bojan ^b   Reed, Bruce ^c  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b SIMON FRASER UNIVERSITY   (Canada)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

Embedding; Genus of a graph; Linear time algorithm; Surface; Tree width

Indexed keywords

ALGORITHM COMPUTES; ARBITRARY SURFACES; COMPLEXITY OF ALGORITHMS; EMBEDDING; EMBEDDINGS; FIXED SURFACES; GENUS OF A GRAPH; GRAPH MINORS; LINEAR TIME ALGORITHM; LONG STANDINGS; OF GRAPHS; ORIENTABLE; ORIGINAL ALGORITHMS; SPIN-OFFS; TREE-WIDTH;

COMPUTATIONAL GEOMETRY; COMPUTERS; FIBER OPTIC CHEMICAL SENSORS;

TREES (MATHEMATICS);

EID: 57949093690     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.53     Document Type: Conference Paper

References (41)

1. S. Arnborg and A. Proskurowski, Linear time algorithms for NPhard problems restricted to partial k-trees, Discrete Appl. Math. 23 (1989), 11-24.
2. I. Adler, M. Grohe and S. Kreutzer, Computing excluded minors, Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), pp. 641-650, 2008.
3. J. A. Bondy and U. S. R. Murty, Graph Theory, Springer, 2008.
4. K. S. Booth and G.S. Lueker, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-trees, J. Comput. System Sci. 13 (1976), 335-379.
5. H. L. Bodlaender, A linear-time algorithm, for finding tree-decomposition of small treewidth, SIAM J. Comput. 25 (1996), 1305-1317.
6. N. Chiba, T. Nishizeki, S. Abe and T. Ozawa, A linear time algorithm for embedding planar graphs using PQ-trees, J. Comput. System Sci. 30 (1985), 54-76.
7. R. Diestel, K. Yu. Gorbunov, T. R. Jensen, and C. Thomassen, Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser. B 75 (1999), 6.1-73.
8. H. Djidjev and J. H. Reif, An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs, In Proceedings of the 23rd ACM Symposium on Theory of Computing (STOC'91), 337-347, (1991).
9. O(g)) steps, In Proceedings of the 11th ACM Symposium on Theory of Computing (STOC'79), 27-37, (1979).
10. J. E. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components, Siam J. Comput. 3 (1973), 135-158.
11. J. E. Hopcroft and R. Tarjan, Efficient planarity testing, J. ACM 21 (1974), 549-568.
12. M. Juvan, J. Marinček and B. Mohar, Elimination of local bridges, Math. Slovaca 47 (1997), 85-92.
13. M. Juvan, J. Marinček and B. Mohar, Obstructions for simple embeddings, Australas. J. Combin. 38 (2006), 3-25.
14. M. Juvan, J. Marinček and B. Mohar, Embedding a graph into a torus in linear time, Integer programming and combinatorial optimization (Copenhagen, 1995), 360-363, Lecture Notes in Comput. Sci. 920, Springer, Berlin, 1995
15. M. Juvan and B. Mohar, Extending 2-restricted partial embeddings of graphs, Europ. J. Combin. 26 (2005), 339-375.
16. K. Kawarabayashi and B. Reed, Computing crossing number in linear time, Proc. 39th ACM Symposium on Theory of Computing (STOC 07), 382-390.
17. K. Kawarabayashi and B. Mohar, Graph and Map Isomorphism and all polyhedral embeddings in linear time, to appear in Proc. 40th ACM Symposium on Theory of Computing (STOC 08).
18. B. Mohar, Combinatorial local planarity and the width of graph embeddings, Canad. J. Math., 44 (1992), 1272-1288.
19. B. Mohar, Projective planarity in linear time, J. Algrorithms 15 (1993), 482-502.
20. B. Mohar, Obstructions for the disk and the cylinder embedding extension problems, Combin. Probab. Comput. 3 (1994), 375-406.
21. B. Mohar, Embedding graphs in an arbitrary surface in linear time, In Proc. 28th Ann. ACM STOC, Philadelphia, ACM Press, 1996, pp. 392-397.
22. B. Mohar, Obstructions for 2-Möbius band embedding extensions, Siam J. Discrete Math. 10 (1997), 57-72.
23. B. Mohar, A linear time algorithm for embedding graphs in an arbitrary surface, SIAM J. Discrete Math. 12 (1999) 6-26.
24. B. Mohar, Face covers and the genus of apex graphs, J. Combin. Theory, Ser. B 82 (2001), 102-117.
25. B. Mohar, Graph minors and graphs on surfaces, in "Surveys in Combinatorics, 2001 (Sussex)", London Math. Soc. Lecture Note Ser. 288, Cambridge Univ. Press, Cambridge, 2001, pp. 145-163.
26. B. Mohar, Universal obstructions for embedding extension problems, Australas. J. Combin. 36 (2006), 39-68.
27. B. Mohar, A. Schrijver, Blocking nonorientability of a surface, J. Combin. Theory, Ser. B 87 (2003), 2-16.
28. B. Mohar and C. Thomassen, Graphs on Surfaces, Johns Hopkins University Press, Baltimore, MD, 2001.
29. L. Perković and B. Reed, An improved algorithm for finding tree decompositions of small width, International Journal on the Foundations of Computing Science 11 (2000), 81-85.
30. B. Reed, Tree width, and tangles: a new connectivity measure and some applications, in "Surveys in Combinatorics, 1997(London)", London Math. Soc. Lecture Note Ser. 241, Cambridge Univ. Press, Cambridge, 1997, pp. 87-162.
31. B. Reed, Rooted Routing in the Plane, Discrete Appl. Math. 57 (1995), 213-227.
32. B. Reed, N. Robertson, A. Schrijver and P. D. Seymour, Finding disjoint trees in planar graphs in linear time. Graph structure theory (Seattle, WA, 199.1), 295-301, Contemp. Math. 147, Amer. Math. Soc., Providence, RI, 1993.
33. B. Reed and D. Wood, A linear time algorithm to find a separator in a graph with an excluded minor, preprint.
34. N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser: B 41 (1986), 92-114.
35. N. Robertson and P. D. Seymour, Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B 63 (1995), 65-110.
36. N. Robertson, P. D. Seymour and R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser: B 62 (1994), 323-348.
37. P. D. Seymour, A bound on the excluded minors for a surface, preprint.
38. P. Seymour and R. Thomas, Graph searching and a min-max theorem for tree-width, J. Combin. Theory Ser. B 58 (1993), 22-33.
39. C. Thomassen, The graph genus problem is NP-complete, J. Algorithms 10 458-476, (1988).
40. C. Thomassen, A simpler proof of the excluded minor theorem for higher surfaces, J. Combin. Theory Ser: B 70 (1997), 306-311.
41. S. G. Williamson, Depth-first search and Kuratowski subgraphs, J. ACM 31 (1984), 681-693.