Abstract
This paper is devoted to the study of graph embeddings in the grid of non-planar surfaces. We provide an adequate model for those embeddings and we study the complexity of minimizing the number of bends. In particular, we prove that testing whether a graph admits a rectilinear (without bends) embedding essentially equivalent to a given embedding, and that given a graph, testing if there exists a surface such that the graph admits a rectilinear embedding in that surface are NP-complete problems and hence the corresponding optimization problems are NP-hard.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Dolev and R. Trickey. On linear area embedding of planar graphs. Technical Report STAN-CS-81-876, 1981.
M. Fréchet and Ky Fan. Initiation to Combinatorial Topology. Weber and Schmidt, 1967.
M. R. Garey and D. S. Johnson. Computers and Intractability: a guide to the theory of NP-completeness. Freeman, 1979.
A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. In R. Tamassia and I. G. Tollis, editors, Graph Drawing 94, Lectures Notes in Computer Science, pages 286–297. Springer-Verlag, 1994.
J. L. Gross and T. W. Tucker. Topological graph theory. John Wiley & Sons, 1987.
T. A. J. Nicholson. Permutation procedure for minimizing the number of crossings in a network. Proc. Inst. Elec. Eng., 115:21–26, 1968.
R. Tamassia. On embedding a graph in the grid with the minimum number of bends. Siam J. Comput., 16(3):421–444, 1987.
C. Thomassen. The graph genus problem is NP-complete. Journal of Algorithms, 10:568–576, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garrido, M.A., Márquez, A. (1997). Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard. In: DiBattista, G. (eds) Graph Drawing. GD 1997. Lecture Notes in Computer Science, vol 1353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63938-1_56
Download citation
DOI: https://doi.org/10.1007/3-540-63938-1_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63938-1
Online ISBN: 978-3-540-69674-2
eBook Packages: Springer Book Archive