Computing and drawing isomorphic subgraphs

Journal of Graph Algorithms and Applications

Volumn 8, Issue 2, 2004, Pages 215-238

  Bachl, S ^a   Brandenburg, F J ^b   Gmach, D ^c  

^a Batavis GmbH and Co KG   (Germany)

^b UNIVERSITY OF PASSAU   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON SUBGRAPH; DISJOINT SUBGRAPHS; DRAWING ALGORITHMS; ISOMORPHIC SUBGRAPHS; NP-HARD; OUTERPLANAR GRAPH; SPRING ALGORITHMS; SUBGRAPH PROBLEMS; SUBGRAPHS; WEIGHTING FUNCTIONS;

GRAPH THEORY;

EID: 24344446828     PISSN: 15261719     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00090     Document Type: Conference Paper

References (37)

1. S. Bachl. Isomorphic subgraphs. In Proc. Graph Drawing'99, volume 1731 of LNCS, pages 286-296, 1999.
2. S. Bachl. Erkennung isomorpher Subgraphen und deren Anwendung beim Zeichnen von Graphen. Dissertation, Universität Passau, 2001. www.opus-bayern.de/uni-passau/volltexte/2003/14/.
3. T. Biedl, J. Marks, K. Ryall, and S. Whitesides. Graph multidrawing: Finding nice drawings without defining nice. In Proc. Graph Drawing'98, volume 1547 of LNCS, pages 347-355. Springer Verlag, 1998.
4. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo. The maximum clique problem, volume 4 of Handbook of Combinatorial Optimization. Kluwer Academic Publishers, Boston, MA, 1999.
5. F. J. Brandenburg. Symmetries in graphs. Dagstuhl Seminar Report, 98301:22, 1998.
6. F. J. Brandenburg. Pattern matching problems in graphs. Unpublished manuscript, 2000.
7. C. Bron and J. Kerbosch. Algorithm 457 - finding all cliques in an undirected graph. Comm. ACM, 16:575-577, 1973.
8. H.-L. Chen, H.-I. Lu, and H.-C. Yen. On maximum symmetric subgraphs. In Proc. Graph Drawing'00, volume 1984 of LNCS, pages 372-383, 2001.
9. J. Clark and D. Holton. Graphentheorie - Grundlagen und Anwendungen. Spektrum Akademischer Verlag, Heidelberg, 1991.
10. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs, NJ, 1999.
11. G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirements and symmetry display of planar upwards drawings. Discrete Comput. Geom., 7:381-401, 1992.
12. P. Eades. A heuristic for graph drawing. In Cong. Numer., volume 42, pages 149-160, 1984.
13. P. Eades. Drawing free trees. Bulletin of the Institute for Combinatorics and its Applications, 5:10-36, 1992.
14. P. Eades and X. Lin. Spring algorithms and symmetry. Theoret. Comput. Sci., 240:379-405, 2000.
15. P. Eades, X. Lin, and R. Tamassia. An algorithm for drawing a hierarchical graph. Int. J. Comput. Geom. & Appl., 6:145-155, 1996.
16. M. Forster. Zeichnen ungerichteter graphen mit gegebenen knotengrößen durch ein springembedder- verfahren. Diplomarbeit, Universität Passau, 1999.
17. A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In Proc. Graph Drawing'94, volume 894 of LNCS, pages 388-403, 1995.
18. T. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software - Practice and Experience, 21:1129-1164, 1991.
19. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, 1979.
20. D. Gmach. Erkennen von isomorphen subgraphen mittels cliquensuche im produktgraph. Diplomarbeit, Universität Passau, 2003.
21. A. Gupta and N. Nishimura. The complexity of subgraph isomorphism for classes of partial k-trees. Theoret. Comput. Sci., 164:287-298, 1996.
22. S.-H. Hong and P. Eades. A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs. In Proc. Graph Drawing'04, volume 3383 of LNCS, pages 307-317, 2004.
23. S.-H. Hong and P. Eades. Symmetric layout of disconnected graphs. In Proc. ISAAC 2005, volume 2906 of LNCS, pages 405-414, 2005.
24. S.-H. Hong, B. McKay, and P. Eades. Symmetric drawings of triconnected planar graphs. In Proc. 13 ACM-SIAM Symposium on Discrete Algorithms, pages 356-365, 2002.
25. I. Koch. Enumerating all connected maximal common subgraphs in two graphs. Theoret. Comput. Sci., 250:1-30, 2001.
26. G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9:341-352, 1972.
27. A. Lubiw. Some np-complete problems similar to graph isomorphism. SIAM J. Comput., 10:11-21, 1981.
28. J. Manning. Computational complexity of geometric symmetry detection in graphs. In LNCS, volume 507 of LNCS, pages 1-7, 1990.
29. J. Manning. Geometric symmetry in graphs. PhD thesis, Purdue Univ., 1990.
30. Passau test suite. http://www.infosun.uni-passau.de/br/isosubgraph. University of Passsau.
31. H. Purchase. Which aesthetic has the greatest effect on human understanding. In Proc. Graph Drawing'97, volume 1353 of LNCS, pages 248-261, 1997.
32. H. Purchase, R. Cohen, and M. James. Validating graph drawing aesthetics. In Proc. Graph Drawing'95, volume 1027 of LNCS, pages 435-446, 1996.
33. R. C. Read and R. J. Wilson. An Atlas of Graphs. Clarendon Press Oxford, 1998.
34. E. M. Reingold and J. S. Tilford. Tidier drawings of trees. IEEE Trans. SE, 7:223-228, 1981.
35. Roma graph library, http://www.inf.uniroma3.it/people/gdb/wp12/LOG.html. University of Rome 3.
36. K. J. Supowit and E. M. Reingold. The complexity of drawing trees nicely. Acta Informatica, 18:377-392, 1983.
37. J. R. Ullmann. An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach., 16:31-42, 1970.