Skip to main content
SpringerLink
Log in

Symmetric Layout of Disconnected Graphs

  • Conference paper
Algorithms and Computation (ISAAC 2003)

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

Included in the following conference series:

Abstract

We present a linear time algorithm for drawing disconnected planar graphs with maximum number of symmetries. Our algorithm can be generalized to making symmetric arrangements of bounded disjoint objects in the plane.

This research has been supported by a grant from the Australian Research Council. In this extended abstract, proofs are omitted.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Abelson, D., Hong, S., Taylor, D.E.: A Group-Theoretic Method for Drawing Graphs Symmetrically. In: Graph Drawing 2002. LNCS, pp. 86–97. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Buchheim, C., Junger, M.: Detecting Symmetries by Branch and Cut. In: Graph Drawing 2001. LNCS, pp. 178–188. Springer, Heidelberg (2001)

    Google Scholar 

  3. Eades, P.: Symmetry Finding Algorithms. In: Computational Morphology, Machine Intelligence and Pattern Recognition, pp. 41–51. North Holland, Amsterdam (1988)

    Google Scholar 

  4. Eades, P., Lin, X.: Spring Algorithms and Symmetries. Theoretical Computer Science 240, 379–405 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. de Fraysseix, H.: An Heuristic for Graph Symmetry Detection. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 276–285. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Freivalds, K., Dogrusoz, U., Kikusts, P.: Disconnected Graph Layout and the Polyomino Packing Approach. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 378–391. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Hong, S., Eades, P., Lee, S.: Drawing Series Parallel Digraphs Symmetrically. Computational Geometry: Theory and Applicatons 17(3-4), 165–188 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hong, S., McKay, B., Eades, P.: Symmetric Drawings of Triconnected Planar Graphs. In: Proc. of SODA 2002, pp. 356–365 (2002)

    Google Scholar 

  9. Hong, S., Eades, P.: Drawing Planar Graphs Symmetrically II: Biconnected Graphs, Technical Report CS-IVG-2001-01, School of IT, University of Sydney (2001)

    Google Scholar 

  10. Hong, S., Eades, P.: Drawing Planar Graphs Symmetrically III: One-connected Graphs, Technical Report CS-IVG-2001-02, School of IT, University of Sydney (2001)

    Google Scholar 

  11. Hopcroft, J.E., Wong, J.K.: Linear Time Algorithm for Isomorphism of Planar Graphs. In: Proc. of STOC, pp. 172–184 (1974)

    Google Scholar 

  12. Mani, P.: Automorphismen von Polyedrischen Graphen. Math. Annalen 192, 279–303 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  13. Manning, J.: Geometric Symmetry in Graphs, Ph.D. Thesis, Purdue Univ. (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of information Technologies, University of Sydney, Australia

    Seok-Hee Hong & Peter Eades

Authors
  1. Seok-Hee Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Eades
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Science and Technology, Kwansei Gakuin University, Sanda, Japan

    Toshihide Ibaraki

  2. Department of Architecture and Architectural Engineering, Kyoto University, 615-8540, Nishikyo-ku, Kyoto, Japan

    Naoki Katoh

  3. Department of Computer Science and Communication Engineering, Kyushu University, 812-8581, Fukuoka, Japan

    Hirotaka Ono

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hong, SH., Eades, P. (2003). Symmetric Layout of Disconnected Graphs . In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24587-2_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20695-8

  • Online ISBN: 978-3-540-24587-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation