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.
Cite
CITATION STYLE
APA
Juvan, M., Marinček, J., & Mohar, B. (1995). Embedding graphs in the torus in linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 920, pp. 360–363). Springer Verlag. https://doi.org/10.1007/3-540-59408-6_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free