Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Yuster, R., and Zwick, U. (1995): “Color-coding”, Journal of the Association of Computing Machinery, 42 (4), 844–856.
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.
Benstock, J., Berndt, D., and Agarwal, K. (1988): “Graph embedding in synchem2, an expert system for organic synthesis discovery”. Discrete Applied Mathematics, 19, 45–63.
Bondy, J. and Murty, U. (1976): “Graph Theory with Applications”,The MacMillan Press.
Bruno, L.J., Kemp, N.M., Artymiuk, P.J., and Willett, P. (1997): “Representation and searching of carbohydrate structures using graph-theoretic techniques”, Carbohydrate Research, 304, 61–67
Bunke, H. and Allermann, G. (1983): “Inexact graph matching for structural pattern recognition”, Pattern Recognition Letters, 1, 245–253.
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.
Chen, L. (1996): “Graph isomorphism and identification matrices: Parallel algorithms”, IEEE Transactions on Parallel and Distributed Systems, 7 (3), 308–319.
Crowl, L., Crovella, M., LeBlanc, T., and M.L.Scott (1994): “The advantages of multiple parallelizations in combinatorial search”, Journal of Parallel and Distributed Computing, 21, 110–123.
Galil, Z., Hoffmann, C., Luks, E., Schnorr, C., and Weber, A. (1987): “An o(n 3 log n) deterministic and an o(n 3 ) las vegas isomorphism test for trivalent graphs”, Journal of the Association of Computing Machinery, 34 (3), 513–531.
Garey, M. and Johnson, D. (1979): “Computers and Intractability: A Guide to the Theory of NP-Completeness”, W.H. Freeman and Company.
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.
Jaja, J. and Kosaraju, S. (1988): “Parallel algorithms for planar graph isomorphism and related problems”, IEEE Transactions on Circuits and Systems, 35 (3), 304–310.
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, July
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 Programming
Lu, S.W., Ren, Y. and Suen, C.Y. (1991): “Hierarchical attributed graph representation and recognition of handwritten Chinese characters”, Pattern Recognition, Vol. 24, pp 617–632.
Matula, D. (1978): “Subtree isomorphism in o(n 512 )”. Annals of Discrete Mathematics, 2, 91–106.
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.
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.
Rao, V. and Kumar, V. (1987): “Parallel depth first search, part is Implementation”, International Journal of Parallel Programming, 16 (6), 479–499.
Rekers, J and Schurr, A (1997): “Defining and parsing visual languages with layered graph grammars”, Journal of Visual Languages and Computing, Vol. 8, 27–55.
Rocha, J. and Pavlidis, T. (1994): “A shape analysis model with applications to a character recognition system”, IEEE Trans. On Pattern Analysis and Machine Intelligence, Vol. 16, 393–404.
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.
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.
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 )
Ullmann, J. (1976): “An algorithm for subgraph isomorphism”. Journal of the Association for Computing Machinery, 23 (1), 31–42.
Wong, E. (1992): “Model matching in robot vision by subgraph isomorphism”. Pattern Recognition, 25 (3), 287–303.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Campbell, S., Kumar, M., Bunke, H. (2001). Parallel Subgraph Matching on a Hierarchical Interconnection Network. In: Teodorescu, HN., Jain, L.C., Kandel, A. (eds) Hardware Implementation of Intelligent Systems. Studies in Fuzziness and Soft Computing, vol 74. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1816-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1816-1_9
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-2491-9
Online ISBN: 978-3-7908-1816-1
eBook Packages: Springer Book Archive