Abstract
A linear time algorithm is presented that, for a given graph G, finds an embedding of G in the torus whenever such an embedding exists, or exhibits a subgraph Ω of G of small branch size that cannot be embedded in the torus.
The complete version of this work will appear elsewhere.
Supported in part by the Ministry of Science and Technology of Slovenia, Research Project P1-0210-101-94.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. S. Booth, 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.
I. S. Filotti, An algorithm for imbedding cubic graphs in the torus, J. Comput. System Sci. 20 (1980) 255–276.
I. S. Filotti, G. L. Miller, J. Reif, On determining the genus of a graph in O(υo(g)) steps, in “Proceedings, 11th Annu. ACM STOC, Atlanta, Georgia, 1979,” pp. 27–37.
J. E. Hopcroft, R. E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput. 2 (1973) 135–158.
J. E. Hopcroft, R. E. Tarjan, Efficient planarity testing, J. ACM 21 (1974) 549–568.
M. Juvan, J. Marinček, B. Mohar, Elimination of local bridges, submitted.
M. Juvan, J. Marinček, B. Mohar, Obstructions for simple embeddings, submitted.
M. Juvan, J. Marinček, B. Mohar, Embedding a graph into the torus in linear time, submitted.
M. Juvan, J. Marinček, B. Mohar, Efficient algorithm for embedding graphs in arbitrary surfaces, in preparation.
M. Juvan, B. Mohar, Extending 2-restricted partial embeddings of graphs, submitted.
N. Robertson, P. D. Seymour, Graph minors. VIII. A Kuratowski theorem for general surfaces, J. Combin. Theory, Ser. B 48 (1990) 255–288.
N. Robertson, P. D. Seymour, Graph minors. XIII. The disjoint paths problem, preprint, revision of February 1992.
N. Robertson, P. D. Seymour, Graph minors. XXI. Graphs with unique linkages, preprint, 1992.
N. Robertson, P. D. Seymour, Graph minors. XXII. Irrelevant vertices in linkage problems, preprint, 1992.
C. Thomassen, The graph genus problem is NP-complete, J. Algorithms 10 (1989) 568–576.
S. G. Williamson, Embedding graphs in the plane — algorithmic aspects, Ann. Discrete Math. 6 (1980) 349–384.
S. G. Williamson, Depth-first search and Kuratowski subgraphs, J. ACM 31 (1984) 681–693.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Juvan, M., Marinček, J., Mohar, B. (1995). Embedding graphs in the torus in linear time. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_64
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive