Errors in graph embedding algorithms

Journal of Computer and System Sciences

Volumn 77, Issue 2, 2011, Pages 430-438

  Myrvold, Wendy ^a   Kocay, William ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Algorithm; Graph embedding; Graph genus; Torus

Indexed keywords

ALGORITHMS; EMBEDDINGS;

EXPONENTIAL TIME; GRAPH EMBEDDINGS; GRAPH GENUS; PLANARITY; TESTING ALGORITHM; TORUS;

GRAPH ALGORITHMS;

EID: 78651334415     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.06.002     Document Type: Article

References (26)

1. J. Boyer Additional PC-tree planarity conditions J. Pach, Proceedings of the 12th International Conference on Graph Drawing 2004 2004 Springer-Verlag 82 88
2. G. Brinkmann Fast generation of cubic graphs J. Graph Theory 2 1996 139 149
3. J. Chambers, Hunting for torus obstructions, MSc thesis, University of Victoria, 2002.
4. G. Demoucron, Y. Malgrange, and R. Pertuiset Graphes planaires Rev. Française Recherche Opérationnelle 8 1964 33 47
5. N. Deo Note on Hopcroft and Tarjan planarity algorithm J. ACM 23 1976 74 75
6. H. Djidjev, J. Reif, An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs, in: Proc. of the 23rd ACM Symp. Theory of Comp., 1991, pp. 337-347.
7. I.S. Filotti An algorithm for embedding cubic graphs in the torus J. Comput. System Sci. 2 1980 255 276
8. I.S. Filotti, An efficient algorithm for determining whether a cubic graph is toroidal, in: Proc. of the 10th ACM Symp. Theory of Comp., 1978, pp. 133-142.
9. I.S. Filotti, Jack Mayer, A polynomial algorithm for determining the isomorphism of graphs of fixed genus, in: Proc. of the 12th ACM Symp. Theory of Comp., 1980, pp. 236-243.
10. I.S. Filotti, G.L. Miller, J. Reif, On determining the genus of a graph in O (vO (g ) ) steps, in: Proc. of the 11th ACM Symp. Theory of Comp., 1979, pp. 27-37.
11. A. Gagarin, and W. Kocay Embedding graphs containing K 5 subdivisions Ars Combin. 68 2002 33 45
12. A. Gagarin, W. Kocay, and D. Neilson Embeddings of small graphs on the torus Cubo 5 2003 351 371
13. A. Gibbons Algorithmic Graph Theory 1985 Cambridge University Press Cambridge
14. J. Hopcroft, and R. Tarjan Efficient planarity testing J. ACM 21 1974 549 568
15. M. Juvan, J. Marinček, and B. Mohar Embedding a graph in the torus in linear time Integer Programming and Combinatorial Optimization Lecture Notes in Comput. Sci. vol. 920 1995 Springer 360 363
16. W. Kocay, and D. Kreher Graphs, Algorithms, and Optimization 2005 Chapman and Hall, CRC Press Boca Raton, FL
17. Gary Miller, Isomorphism testing for graphs of bounded genus, in: Proc. of the 12th ACM Symp. Theory of Comp., 1978, pp. 225-235.
18. B. Mohar Projective planarity in linear time J. Algorithms 15 1993 482 502
19. B. Mohar, Embedding graphs in an arbitrary surface in linear time, in: Proc. of the 28th ACM Symp. Theory of Comp., 1996, pp. 392-397.
20. B. Mohar A linear time algorithm for embedding graphs in an arbitrary surface SIAM J. Discrete Math. 12 1999 6 26
21. B. Mohar, and C. Thomassen Graphs on Surfaces 2001 Johns Hopkins University Press Baltimore, MD
22. E. Neufeld, Practical toroidality testing, MSc thesis, University of Victoria, 1993.
23. E. Neufeld, W. Myrvold, Practical toroidality testing, in: Proc. of the 8th ACM-SIAM Symp. on Disc. Alg., 1997, pp. 574-580.
24. B. Perunicic, and Z. Duric An efficient algorithm for embedding graphs in the projective plane The Fifth Quadrennial International Conference on the Theory and Applications of Graphs with Special Emphasis on Algorithms and Computer Science Applications 1984 Western Michigan University, John Wiley and Sons, Inc. 637 650
25. W.-K. Shih, and W.-L. Hsu A new planarity test Theoret. Comput. Sci. 223 1999 179 191
26. J. Woodcock, A faster algorithm for torus embedding, MSc thesis, University of Victoria, 2006.