Abstract
In this paper an extension of index-based subgraph matching is proposed. This extension significantly reduces the storage amount and indexing time for graphs where the nodes are labeled with a rather small amount of different classes. In order to reduce the number of possible permutations, a weight function for labeled graphs is introduced and a well-founded total order is defined on the weights of the labels. Inversions which violate the order are not allowed. A computational complexity analysis of the new preprocessing is given and its completeness is proven. Furthermore, in a number of practical experiments with randomly generated graphs the improvement of the new approach is shown. In experiments performed on random sample graphs, the number of permutations has been decreased to a fraction of 10− 18 in average compared to the original approach by Messmer. This makes indexing of larger graphs feasible, allowing for fast detection of subgraphs.
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
Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters 18(8), 689–694 (1997)
Bunke, H., Messmer, B.: Efficient attributed graph matching and its application to image analysis, pp. 44–55 (1995)
Bunke, H.: Graph matching: Theoretical foundations, algorithms, and applications. In: Proc. Vision Interface (2000)
Bunke, H.: Recent developments in graph matching. International Conference on Pattern Recognition 2, 2117 (2000)
Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. In: Pattern Recognition Letters, pp. 255–259 (1998)
Cheng, J., Huang, T.: Image registration by matching relational structures. Pattern Recognition 17(1), 149–159 (1984)
Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Analysis and Applications 13(1), 113–129 (2009)
Kim, W., Kak, A.: 3-d object recognition using bipartite matching embedded in discrete relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence 13, 224–251 (1991)
Messmer, B., Bunke, H.: A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition 32, 1979–1998 (1999)
Rosen, K.H.: Discrete mathematics and its applications, 2nd edn. McGraw-Hill, Inc., New York (1991)
Schomburg, I., Chang, A., Ebeling, C., Gremse, M., Heldt, C., Huhn, G., Schomburg, D.: BRENDA, the enzyme database: updates and major new developments. NUCLEIC ACIDS RESEARCH 32(SI) (January 2004)
Ullmann, J.: An algorithm for subgraph isomorphism. Journal of the ACM (JACM) 23(I), 31–42 (1976)
Weber, M., Langenhan, C., Roth-Berghofer, T., Liwicki, M., Dengel, A., Petzold, F.: a.SCatch: Semantic Structure for Architectural Floor Plan Retrieval. In: Bichindaritz, I., Montani, S. (eds.) ICCBR 2010. LNCS, vol. 6176, Springer, Heidelberg (2010)
Wong, E.K.: Model matching in robot vision by subgraph isomorphism. Pattern Recogn 25, 287–303 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weber, M., Liwicki, M., Dengel, A. (2011). Indexing with Well-Founded Total Order for Faster Subgraph Isomorphism Detection. In: Jiang, X., Ferrer, M., Torsello, A. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2011. Lecture Notes in Computer Science, vol 6658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20844-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-20844-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20843-0
Online ISBN: 978-3-642-20844-7
eBook Packages: Computer ScienceComputer Science (R0)