Isomorphic Subgraphs

  • Sabine Bachl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)

Abstract

We are interested in finding symmetries in graphs and then use these symmetries for graph drawing algorithms. There are two general approaches to this problem, the first one is known as Geometric Symmetries on the basis of drawings, the other rests upon the graph-theoretical notion of graphs. For a given graph G the Isomorphic Subgraphs problem makes use of the second approach and tries to find the two largest disjoint isomorphic subgraphs in G. Hence, G consists of two identical copies and a remainder. There are many NP-complete or open problems related to our problem, like Graph Isomorphism, Graph Automorphism or Largest Common Subgraph. We show that the Isomorphic Subgraphs problem is NP-hard for connected outerplanar graphs, and 2-connected planar graphs and is solvable in linear time when restricted to trees. Additionally we will shortly discuss the applicability of Isomorphic Subgraphs in graph drawing algorithms

References

  1. [1]
    W. Bachl. Entwicklung und Implementierung eines Hierarchischen Springem-bedders. Diplomarbeit, Universität Passau, 1995.Google Scholar
  2. [2]
    F. J. Brandenburg. Designing graph drawings by layout graph grammars. In Proc. Graph Drawing 1994, Lecture Notes in Computer Science 894, pages 416–427. Springer, 1995.Google Scholar
  3. [3]
    F.J. Brandenburg and S. Wetzel. On pairs of large common subgraphs. unpublished manuscript, http://www.fmi.uni-passau.de/~wetzel/paper/, 1998.
  4. [4]
    Qing-Wen Feng, Robert F. Cohen, and Peter Eades. How to draw a planar clustered graph. In Ding-Zhu Du and Ming Li, editors, Computing and Combinatorics COCOON’ 95, Lecture Notes in Computer Science 959, pages 21–30. Springer, 1995.CrossRefGoogle Scholar
  5. [5]
    Qing-Wen Feng, Robert F. Cohen, and Peter Eades. Planarity for clustered graphs. In Paul Spirakis, editor, Algorithms-ESA’ 95, Lecture Notes in Computer Science 979, pages 213–226. Springer, 1995.Google Scholar
  6. [6]
    M.R. Garey and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.Google Scholar
  7. [7]
    D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.Google Scholar
  8. [8]
    R.E. Ladner. On the structure of polynomial time reducibility. Journal of the ACM, 22:155–171, 1975.MATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    Giorgio Levi and Fabrizio Luccio. A technique for graph embedding with constraints on node and arc correspondences. Information Sciences, 5:1–24, 1973.CrossRefMathSciNetGoogle Scholar
  10. [10]
    Andrzej Lingas. Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theoretical Computer Science, 63:295–302, 1989.MATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    R. J. Lipton, S. C. North, and J. S. Sandberg. A method for drawing graphs. In Proc. ACM Symposium on Computational Geometry, pages 153–160. ACM, 1985.Google Scholar
  12. [12]
    A. Lubiw. Some NP-complete problems similar to graph isomorphism. SIAM J. Comput., 10(1):11–21, 1981.MATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    J. Manning. Geometric Symmetry in Graphs. PhD thesis, Department of Computer Science, Purdue University, 1990.Google Scholar
  14. [14]
    J. Manning and M. J. Atallah. Fast detection and display of symmetry in trees. Congressus Numerantium, 64:159–168, 1988.MathSciNetGoogle Scholar
  15. [15]
    J. Manning and M.J. Atallah. Fast detection and display of symmetry in outer-planar graphs. Discrete Applied Mathematics, 39:13–35, 1992.MATHCrossRefMathSciNetGoogle Scholar
  16. [16]
    H. Purchase. Which aesthetic has the greatest effect on human understanding. In Proc. Graph Drawing 1997, Lecture Notes in Computer Science 1353, pages 248–261. Springer, 1997.CrossRefGoogle Scholar
  17. [17]
    H. C. Purchase, R. F. Cohen, and M. James. Validating graph drawing aesthetics. In Proc. Graph Drawing 1995, Lecture Notes in Computer Science 1027, pages 435–446. Springer, 1996.CrossRefGoogle Scholar
  18. [18]
    Ronald C. Read and Derek G. Corneil. The graph isomorphism disease. Journal of Graph Theory, 1:339–363, 1977.MATHCrossRefMathSciNetGoogle Scholar
  19. [19]
    Steven W. Reyner. An analysis of a good algorithm for the subtree problem. SIAM J. Comput., 6(4):730–732, 1977.MATHCrossRefMathSciNetGoogle Scholar
  20. [20]
    U. Schöning. Graph isomorphism is in the low hierarchy. Journal. Comput. Syst. Science, 37:312–323, 1987.CrossRefGoogle Scholar
  21. [21]
    Maciej M. Syslo. The subgraph isomorphism problem for outerplanar graphs. Theoretical Computer Science, 17:91–97, 1982.MATHCrossRefMathSciNetGoogle Scholar
  22. [22]
    E. Ukkonen. On-line construction of suffix-trees. In Algorithmica 14, pages 249–260, 1995.Google Scholar
  23. [23]
    P. Weiner. Linear pattern matching algorithms. In Proc. of the 14th IEEE Symp. on Switching and Automata Theory, pages 1–11, 1973.Google Scholar
  24. [24]
    F. Frances Yao. Graph 2-isomorphism is NP-complete. Information Processing Letters, 9(2):68–72, August 1979.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Sabine Bachl
    • 1
  1. 1.University of PassauPassauGermany

Personalised recommendations