A system for drawing graphs with geometric symmetry

  • Joseph Manning
  • Mikhail Atallah
  • Kingsley Cudjoe
  • Joe Lozito
  • Ron Pacheco
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)

Abstract

This demonstration presents a computer system to generate symmetric drawings of certain classes of planar graphs.

References

  1. 1.
    A. Aho, J. Hopcroft, J. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)Google Scholar
  2. 2.
    P. Eades: A Heuristic for Drawing Graphs. Congressus Numerantium 42 (1984) 149–160Google Scholar
  3. 3.
    D. Knuth, J. Morris, V. Pratt: Fast Pattern Matching in Strings. SIAM Journal on Computing 6 (1977) 323–350Google Scholar
  4. 4.
    R. Lipton, S. North, J. Sandberg: A Method for Drawing Graphs. Proceedings of the ACM Symposium on Computational Geometry 1 (1986) 153–160Google Scholar
  5. 5.
    J. Manning, M. Atallah: Fast Detection and Display of Symmetry in Trees. Congressus Numerantium 64 (1988) 159–169Google Scholar
  6. 6.
    J. Manning, M. Atallah: Fast Detection and Display of Symmetry in Outerplanar Graphs. Discrete Applied Mathematics 39 (1992) 13–35Google Scholar
  7. 7.
    J. Manning: Computational Complexity of Geometric Symmetry Detection in Graphs. Lecture Notes in Computer Science 507 (1991) 1–7Google Scholar
  8. 8.
    J. Manning: Geometric Symmetry in Graphs. Ph.D. Thesis, Purdue University (1990)Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Joseph Manning
    • 1
  • Mikhail Atallah
    • 2
  • Kingsley Cudjoe
    • 1
  • Joe Lozito
    • 1
  • Ron Pacheco
    • 3
  1. 1.Vassar CollegeUSA
  2. 2.Purdue UniversityUSA
  3. 3.Harding UniversityUSA

Personalised recommendations