Computing and drawing isomorphic subgraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2528 LNCS, Issue , 2002, Pages 74-85

  Bachl, Sabine ^a   Brandenburg, Franz Josef ^b  

^a SD and M AG   (Germany)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DRAWING (GRAPHICS);

COMMON SUBGRAPH; DISJOINT SUBGRAPHS; DRAWING ALGORITHMS; GRAPH PARTITION; GREEDY HEURISTICS; ISOMORPHIC SUBGRAPHS; SPRING ALGORITHMS; SUBGRAPH PROBLEMS;

GRAPH THEORY;

EID: 23044534702     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36151-0_8     Document Type: Conference Paper

References (31)

1. S. Bachl. Isomorphic subgraphs. Proc. Graph Drawing'99, LNCS 1731 (1999), 286-296.
2. S. Bachl. Erkennung isomorpher Subgraphen und deren Anwendung beim Zeichnen von Graphen. Dissertation, University of Passau, (2001), http://elib.ub.uni-passau.de/index.html.
3. L. Babai and L. Kucera. Canonical labelling of graphs in average linear time. Proc. 20th IEEE FOCS (1979), 39-46.
4. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, (1999).
5. T. Biedl, J. Marks, K. Ryall, and S. Whitesides. Graph multidrawing: Finding nice drawings without defining nice. Proc. Graph Drawing'98, LNCS 1547 (1998), 347-355.
6. F.J. Brandenburg. Pattern matching problems in graphs. Unpublished manuscript, (2000).
7. H.-L. Chen, H.-I. Lu and H.-C. Yen. On maximum symmetric subgraphs. Proc. Graph Drawing'00, LNCS 1984 (2001), 372-383.
8. J. Clark and D. Holton. Graphentheorie - Grundlagen und Anwendungen. Spektrum Akademischer Verlag, (1991).
9. D. Corneil and D. Kirkpatrick. A theoretical analysis of various heuristics for the graph isomorphism problem. SIAM J. Comput. 9, (1980), 281-297.
10. P. Eades. Drawing free trees. Bulletin of the Institute for Combinatorics and its Applications 5, (1992), 10-36.
11. P. Eades. A heuristic for graph drawing. Cong. Numer. 42, (1984), 149-160.
12. P. Eades and X. Lin. Spring algorithms and symmetry. Theoret. Comput. Sci. 240 (2000), 379-405.
13. M. Forster. Zeichnen ungerichteter Graphen mit gegebenen Knotengrößen durch ein Springembedder-Verfahren. Diplomarbeit, Universität Passau, (1999).
14. A. Frick, A. Ludwig and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. Proc. Graph Drawing'94, LNCS 894 (1995), 388-403.
15. T. Fruchterman and E.M. Reingold. Graph drawing by force-directed placement. Software - Practice and Experience 21, (1991), 1129-1164.
16. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, (1979).
17. A. Gupta and N. Nishimura. The complexity of subgraph isomorphism for classes of partial k-trees. Theoret. Comput. Sci. 164, (1996), 287-298.
18. S.-H. Hong, B. McKay and P. Eades. Symmetric drawings of triconnected planar graphs. Proc. 13 ACM-SIAM Symposium on Discrete Algorithms (2002), 356-365.
19. I. Koch. Enumerating all connected maximal common subgraphs in two graphs. Theoret. Comput. Sci. 250, (2001), 1-30.
20. G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9, (1972), 341-352.
21. A. Lubiw. Some NP-complete problems similar to graph isomorphism. SIAM J. Comput. 10, (1981), 11-21.
22. J. Manning. Geometric symmetry in graphs. Ph.D. thesis, Purdue Univ., (1990).
23. J. Manning. Computational complexity of geometric symmetry detection in graphs. LNCS 507, (1990), 1-7.
24. Passau Test Suite. http://www.infosun.uni-passau.de/br/isosubgraph.
25. H. Purchase, R. Cohen and M. James. Validating graph drawing aesthetics. Proc. Graph Drawing'95, LNCS 1027 (1996), 435-446.
26. H. Purchase. Which aesthetic has the greatest effect on human understanding. Proc. Graph Drawing'97, LNCS 1353 (1997), 248-261.
27. R.C. Read and R.J. Wilson An Atlas of Graphs. Clarendon Press Oxford (1998)
28. Roma Graph Library. http://www.inf.uniroma3.it/people/gdb/wp12/LOG.html.
29. E.M. Reingold and J.S. Tilford. Tidier drawings of trees. IEEE Trans. SE 7, (1981), 223-228.
30. K.J. Supowit and E.M. Reingold. The complexity of drawing trees nicely. Acta Informatica 18, (1983), 377-392.
31. J.R. Ullmann. An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach. 16, (1970), 31-42.