Skip to main content
SpringerLink
Log in

Circular Drawings of Biconnected Graphs

  • Chapter
  • First Online:
Algorithm Engineering and Experimentation (ALENEX 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1619))

Included in the following conference series:

Abstract

Many applications which would benefit from an accompanying circular graph drawing include tools which manipulate telecommunication, computer, and social networks. Previous research has produced solutions which are visually complex with respect to the number of crossings. In this paper we focus our attention on developing better and more efficient circular drawing algorithms. In particular we present an O(m 2) algorithm which lays out a biconnected graph onto a single embedding circle. Furthermore, we can guarantee that if a zero crossing circular embedding exists for an input graph, then our algorithm will find it. Also, the results of extensive experiments conducted over a set of 10,328 biconnected graphs and show our technique to perform significantly better than the current technology.

Research supported in part by NIST, Advanced Technology Program grant number 70NANB5H1162 and by the Texas Advanced Research Program under grant number 009741-040.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Brandenburg, Graph Clustering 1: Cycles of Cliques, Proc. GD’ 97, Rome, Italy, Lecture Notes in Computer Science 1353, Springer-Verlag, pp. 158–168.

    Google Scholar 

  2. G. Di Battista, P. Eades, R. Tamassia and I. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory and Applications, 4(5), 1994, pp. 235–282. Also available at http://www.utdallas.edu/~tollis.

    MATH  MathSciNet  Google Scholar 

  3. G. Di Battista, P. Eades, R. Tamassia and I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, Englewood Cliffs, NJ, 1999.

    MATH  Google Scholar 

  4. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, F. Vargiu and L. Vismara, An Experimental Comparison of Four Graph Drawing Algorithms, Computational Geometry: Theory and Applications, 7(5–6), pp.303–25. Also available at http://www.cs.brown.edu/people/rt.

  5. U. Doğrusöz, B. Madden and P. Madden, Circular Layout in the Graph Layout Toolkit, Proc. GD’ 96, Berkeley, California, Lecture Notes in Computer Science 1190, Springer-Verlag, pp. 92–100.

    Google Scholar 

  6. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.

    Google Scholar 

  7. G. Kar, B. Madden and R. Gilbert, Heuristic Layout Algorithms for Network Presentation Services, IEEE Network, November 1988, pp. 29–36.

    Google Scholar 

  8. A. Kershenbaum, Telecommunications Network Design Algorithms, McGraw-Hill, 1993.

    Google Scholar 

  9. V. Krebs, Visualizing Human Networks, Release 1.0: Esther Dyson’s Monthly Report, February 12, 1996, pp. 1–25.

    Google Scholar 

  10. S. Masuda, T. Kashiwabara, K. Nakajima and T. Fujisawa, On the NP-Completeness of a Computer Network Layout Problem, Proc. IEEE 1987 International Symposium on Circuits and Systems, Philadelphia, PA, 1987, pp.292–295.

    Google Scholar 

  11. S. Mitchell, Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs, Information Processing Letters, 9(5), 1979, pp. 229–232.

    Article  MATH  MathSciNet  Google Scholar 

  12. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, 1985.

    Google Scholar 

  13. J. M. Six and I. G. Tollis, Algorithms for Drawing Circular Visualizations of Networks, Manuscript, 1999.

    Google Scholar 

  14. I. G. Tollis, Strategic Directions in Computing Research: Working Group on Computational Geometry: Graph Drawing and Information Visualization, ACM Computing Surveys, 28A(4), December 1996. Also available at http://www.utdallas.edu/~tollis/SDCR96/TollisGeometry/.

  15. I. G. Tollis and C. Xia, Drawing Telecommunication Networks, Proc. GD’ 94, Princeton. New Jersey, Lecture Notes in Computer Science 894, Springer-Verlag, 1994, pp. 206–217.

    Google Scholar 

  16. M. Yannakakis, Edge-Deletion Problems, SIAM J. Computing, 10(2), May 1981, pp.297–309.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CAD & Visualization Lab, Department of Computer Science, The University of Texas at Dallas, P.O. Box 830688, EC 31, Richardson, TX, 75083-0688

    Janet M. Six & Ioannis G. Tollis

Authors
  1. Janet M. Six
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ioannis G. Tollis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, John Hopkins University, Baltimore, MD, 21218, USA

    Michael T. Goodrich

  2. Department of Mathematics and Computer Science, Amherst University, Amherst, MA, 01002, USA

    Catherine C. McGeoch

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Six, J.M., Tollis, I.G. (1999). Circular Drawings of Biconnected Graphs. In: Goodrich, M.T., McGeoch, C.C. (eds) Algorithm Engineering and Experimentation. ALENEX 1999. Lecture Notes in Computer Science, vol 1619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48518-X_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-48518-X_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66227-3

  • Online ISBN: 978-3-540-48518-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation