Advertisement

Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves

  • Emilio Di Giacomo
  • Walter Didimo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2912)

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.

Keywords

Internal Vertex External Face Clockwise Order Embed Graph Planar Drawing 
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

  1. 1.
    Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. JACM 41(1), 153–180 (1994)MATHCrossRefGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Bienstock, C.M.D.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica 5(1), 93–109 (1990)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Emilio Di Giacomo
    • 1
  • Walter Didimo
    • 1
  1. 1.Università di Perugia 

Personalised recommendations