Abstract
Measures of vertex similarity have been incorporated in graph matching algorithms. Graph matching tries to retrieve a 1-1 correspondence between vertices of two given graphs. In this paper, the vertex similarity measure of Blondel et al. is studied for its usefulness in detecting graph isomorphism. Firstly, the applicability of this measure to distinguish similar pairs from dissimilar pairs is shown to be limited in scope even for small graphs. In a preliminary experiment, we show that Blondel’s vertex similarity measure does not retrieve the isomorphism within a graph of 14 nodes. We propose a refinement of Blondel’s measure. Zager et al. also refine Blondel’s measure and further propose a graph matching algorithm. We propose a graph matching algorithm based on the lines of Zager et al. and test our algorithm against Zager’s as well as Blondel’s and show that the proposed refinement performs better than both the measures with regard to graph isomorphism problem. The performance is evaluated systematically on a large bench mark data set made available by Foggia et al. The proposed algorithm performs with 90.10% accuracy on all of the 18,200 pairs of isomorphic graphs available in the benchmark dataset.
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
Leicht, E.A.: Vertex similarity in networks. Phys. Rev. E 73, 26120 (2006)
Kleinberg, J., Authoritative, M.: sources in a hyperlinked environment. J. ACM 46(5), 604–632 (1999)
Blondel, V.D.: A Measure of similarity between graph vertices: Applications to synonym extraction and web searching. Siam. Rev. 46(4), 647–666 (2004)
Melnik, S.: Similarity flooding: A versatile graph matching algorithm and its application to schema Matching. In: ICDE, pp. 117–128 (2002)
Zager, L.A.: Graph similarity scoring and matching. Applied mathematics letters 21, 86–94 (2008)
Kpodjedo, S., Galinier, P., Antoniol, G.: Enhancing a tabu algorithm for approximate graph matching by using similarity measures. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 119–130. Springer, Heidelberg (2010)
Raymond, J.W.: RASCAL: Calculation of graph similarity using maximum common edge sub graphs. The Computer Journal 45(6), 631–644 (2002)
Kuhn, H.: The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2, 83–97 (1955)
Foggia, P.: A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking, http://amalfi.dis.unina.it/graph/
Foggia, P.: Benchmarking data set, http://amalfi.dis.unina.it/graph/
The R project for statistical computing www.r-project.org
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
Bandaru, V., Bhavani, S.D. (2011). Graph Isomorphism Detection Using Vertex Similarity Measure. In: Aluru, S., et al. Contemporary Computing. IC3 2011. Communications in Computer and Information Science, vol 168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22606-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-22606-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22605-2
Online ISBN: 978-3-642-22606-9
eBook Packages: Computer ScienceComputer Science (R0)