Graph pattern analysis with PatternGravisto

Journal of Graph Algorithms and Applications

Volumn 9, Issue 1, 2005, Pages 19-29

  Klukas, Christian ^a   Koschützki, Dirk ^a   Schreiber, Folk ^a  

^a LEIBNIZ INSTITUTE OF PLANT GENETICS AND CROP PLANT RESEARCH IPK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COVER PROBLEM; FLEXIBLE MECHANISMS; GRAPH DRAWING; GRAPH PATTERNS; LAYOUT ALGORITHMS; NAVIGATION TECHNIQUES; PATTERN ANALYSIS; USER FRIENDLY;

DRAWING (GRAPHICS);

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

References (14)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974.
2. S. Bachl. Isomorphe Subgraphen und deren Anwendung beim Zeichnen von Graphen. PhD thesis, Universität Passau, 2001.
3. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
4. P. Foggia, C. Sansone, and M. Vento. A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In Jolion et al. [9], pages 176-187.
5. P. Foggia, C. Sansone, and M. Vento. An improved algorithm for matching large graphs. In Jolion et al. [9], pages 149-159.
6. T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software - Practice, and Experience, 21(11):1129-1164, 1991.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
8. J. E. Hopcroft and J. K. Wong. Linear time algorithm for isomorphism of planar graphs (preliminary report). In Proc. 6th ACM Symposium on Theory of Computing, pages 172-184. ACM Press, 1974.
9. J. M. Jolion, W. Kropatsch, and M. Vento, editors. Proc. 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, 2001.
10. E. M. Luks. Isomorphism of graphs of bounded valance can be tested in polynomial time. Journal of Computer and System Sciences, 25(1):42-65, 1982.
11. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, 298:824-827, 2002.
12. S. Shen-Orr, R. Milo, S. Mangan, and U. Alon. Network motifs in the transcriptional regulation network of escherichia coli. Nature Genetics, 31(1):64-68, 2002.
13. A. Srinivasan, R. D. King, S. H. Muggleton, and M. J. E. Sternberg. The predictive toxicology evaluation challenge. In Proc. 15th International Joint Conference on Artificial Intelligence (IJCAI), pages 1-6, 1997.
14. J. R. Ullmann. An algorithm for subgraph isomorphism. Journal ACM, 23(1):31-42, 1976.