Parallel Subgraph Matching on a Hierarchical Interconnection Network
The identification of subgraph isomorphisms is a well-known problem that occurs in many application areas. An important variant of the problem occurs when there are many model graphs and a single input graph, and we wish to search for subgraph isomorphisms from any of the model graphs to the input graph. This chapter discusses the Parallel Network (PN) algorithm; a parallel, deterministic algorithm for finding subgraph isomorphisms from a database of attributed, directed model graphs to an attributed, directed input graph. The algorithm decomposes the model graphs and forms the resultant subgraphs into a number of search networks. Subgraphs common to any number of model graphs are represented only once. This approach allows rapid, parallel detection of matches of common subgraphs onto the input graph. In parallel, all mappings found for each model graph are searched to detect complete, consistent mappings, which define subgraph isomorphisms. When used on a hierarchical interconnection network, the algorithm allows local communication to be used to advantage, reducing communication overheads and improving performance.
KeywordsModel Graph Input Graph Subgraph Isomorphism Central Vertex Consistent Mapping
Unable to display preview. Download preview PDF.
- Artymiuk, P., Grindley, H., Poirrette, A., Rice, D., Ujah, E., and Willett, P. (1994): “Identification of beta-sheet motifs, of psi-loops and of patterns of acid residues in three dimensional protein structures using a subgraph isomorphism algorithm”, Journal of Chemical Information and Computer Sciences, 34, 54–62.Google Scholar
- Bondy, J. and Murty, U. (1976): “Graph Theory with Applications”,The MacMillan Press.Google Scholar
- Campbell, S. and Kumar, M. (1998): “A novel parallel algorithm for finding subgraph isomorphisms”, Proceedings of Ninth Australasian Workshop on Combinatorial Algorithms, pages 40–51. School of Computing, Curtin University of Technology, Perth WA.Google Scholar
- Hsu, W.-L. (1995): “o(m n) algorithms for the recognition and isomorphism problems on circular-arc graphs”, SIAM Journal of Computing,24(3), 411–439.Google Scholar
- Llados, J., Lopez-Krahe, J., and Martí, E. (1997): “A system to understand hand drawn floor plans using subgraph isomorphism and Hough transform” Machine Vision and Applications,10(3), pp. 150–158, JulyGoogle Scholar
- Lingas, A. and Syslo, M. (1988): “A polynomial time algorithm for subgraph isomorphism of two-connected series-parallel graphs”,Lecture Notes in Computer Science, volume 317, pages 394–409. Springer. Proceedings of the 15th International Colloquium on Automata, Languages and ProgrammingGoogle Scholar
- Messmer, B. and Bunke, H. (1993): “A network based approach to exact and inexact graph matching”, Technical Report IAM-93–021, University of Bern, Institute for informatics and applied mathematics.Google Scholar
- Ohlrich, M., Ebeling, C., Gingting E., and Sather, L. (June 1993): “SubGemini: identifying subcircuits using a fast subgraph isomorphism algorithm”, Proceedings of the 30`“ IEEE/ACM Design Automation Conference.Google Scholar
- Rodgers, P.J. and King, P.J.H. (1997): “A graph-rewriting visual language for database programming”, Journal of Visual Languages and Computing, Vol. 8, 641–674.Google Scholar
- Rouvray, D.H. and Balaban, A.T. (1979): “Chemical applications of graph theory”, R.J. Wilson and L.W. Beineke (eds.): Applications of Graph Theory, 177–221, Academic Press.Google Scholar
- Truhlar, D.G., Jeffrey Howe, W., Hopfinger, A.J. Blaney, A.J. (Eds.) (1999): “Rational Drug Design” (The IMA Volumes in Mathematics and its Applications. Eds.: A. Friedman, R. Gulliver. Vol. 108 )Google Scholar