Abstract
Let G be a bipartite graph, and let λ e ,λ i be two parallel convex curves; we study the question about whether G admits a planar straight line drawing such that the vertices of one partite set of G lie on λ e and the vertices of the other partite set lie on λ i . A characterization is presented that gives rise to linear time testing and drawing algorithms.
Research partially supported by MIUR under Project “ALGO-NEXT”.
Chapter PDF
Similar content being viewed by others
References
Bachmaier, C., Brandenburg, F.J., Forster, M.: Radial level planarity testing and embedding in linear time. J. Graph Algorithms Appl. 9(1), 53–97 (2005)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Upper Saddle River (1999)
Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Comput. Geom.: Theory and Appl. 30, 1–23 (2005)
Eades, P., McKay, B.D., Wormald, N.C.: On an edge crossing problem. In: Proc 9th Austr. Comp. Sci. conf., pp. 327–334. Australian National University (1986)
Eades, P., Whitesides, S.H.: Drawing graphs in two layers. Theoretical Computer Science 131(2), 361–374 (1994)
Harary, F., Schwenk, A.: A new crossing number for bipartite graphs. Utilitas Mathematica 1, 203–209 (1972)
Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)
Tomii, N., Kambayashi, Y., Yajima, S.: On planarization algorithms of 2-level graphs. Technical Report EC77-38, Inst. of Elect. and Comm. Eng. Japan (1977)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Di Giacomo, E., Grilli, L., Liotta, G. (2007). Drawing Bipartite Graphs on Two Curves. In: Kaufmann, M., Wagner, D. (eds) Graph Drawing. GD 2006. Lecture Notes in Computer Science, vol 4372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70904-6_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-70904-6_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70903-9
Online ISBN: 978-3-540-70904-6
eBook Packages: Computer ScienceComputer Science (R0)