Abstract
We study how to draw a 2-outerplane graph on two concentric circles, so that the internal (resp. external) vertices lie on the internal (resp. external) circle.
Research partially supported by “Progetto ALINWEB: Algoritmica per Internet e per il Web”, MIUR Programmi di Ricerca Scientifica di Rilevante Interesse Nazionale.
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
Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. JACM 41(1), 153–180 (1994)
Bodlander, H.L.: Some classes of graphs with bounded tree width. In: Bulletin of the European Association for Theoretical Computer Science, pp. 116–126 (1988)
Cornelsen, S., Schank, T., Wagner, D.: Drawing graphs on two and three lines. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 31–41. Springer, Heidelberg (2002)
Bienstock, C.M.D.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica 5(1), 93–109 (1990)
Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Drawing planar graphs on a curve. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 192–204. Springer, Heidelberg (2003) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Giacomo, E., Didimo, W. (2004). Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive