论文信息 - Graph Pattern Analysis with PatternGravisto

Graph Pattern Analysis with PatternGravisto

The analysis of patterns in graphs has applications in many fields of science. We propose a new method for analyzing graph patterns consisting of a user-friendly and flexible mechanism to specify patterns, an algorithm to recognize multiple appearances of patterns in a target graph, a pattern preserving layout algorithm, and a navigation technique to explore the underlying structure of the graph given by the patterns. This method has been implemented in a tool called PatternGravisto. We demonstrate the utility of our approach with the example graphs from the Graph Drawing Contest 2003 which cover problems from biology and sociology.

[1] Ashwin Srinivasan,et al. The Predictive Toxicology Evaluation Challenge , 1997, IJCAI.

[2] Mario Vento,et al. A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking , 2001 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] Eugene M. Luks,et al. Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[5] Mario Vento,et al. An Improved Algorithm for Matching Large Graphs , 2001 .

[6] John E. Hopcroft,et al. Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[7] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .

[8] Jean-Michel Jolion,et al. 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition , 2001 .

[9] S. Shen-Orr,et al. Network motifs in the transcriptional regulation network of Escherichia coli , 2002, Nature Genetics.

[10] Julian R. Ullmann,et al. An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[11] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[12] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[13] S. Shen-Orr,et al. Network motifs: simple building blocks of complex networks. , 2002, Science.