Abstract
Error-tolerant graph matching has been demonstrated to be an NP-problem, for this reason, several sub-optimal algorithms have been presented with the aim of making the runtime acceptable in some applications. Some well-known sub-optimal algorithms have 6th, cubic or quadratic cost with respect to the order of the graphs. When applications deal with large graphs (social nets), these costs are not acceptable. For this reason, we present an error-tolerant graph-matching algorithm that it is linear with respect to the order of the graphs. Our method needs an initial seed, which is composed of one or several node-to-node mappings. The algorithm has been applied to analyse the friendship variability of social nets.
This research is supported by the spanish projects TIN2016-77836-C2-1-R and ColRobTransp MINECO DPI2016-78957-R AEI/FEDER EU.
Similar content being viewed by others
References
Riesen, K.: Structural Pattern Recognition with Graph Edit Distance. Advances in Computer Vision and Pattern Recognition. Springer, Cham (2015)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18(3), 265–298 (2004)
Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recogn. Artif. Intell. (2013)
Solé, A., Serratosa, F., Sanfeliu, A.: On the graph edit distance cost: properties and applications. Int. J. Pattern Recogn. Artif. Intell. 26(5), 1260004 (2012)
Gold, S., Rangarajan, A.: A Graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 18(4), 377–388 (1996)
Riesen, K. Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(7), 950–959 (2009)
Serratosa, F.: Fast computation of bipartite graph matching. Pattern Recogn. Lett. PRL 45, 244–250 (2014)
Riesen, K., Ferrer, M., Dornberger, R., Bunke, H.: Greedy graph edit distance. In: Perner, P. (ed.) MLDM 2015. LNCS (LNAI), vol. 9166, pp. 3–16. Springer, Cham (2015). doi:10.1007/978-3-319-21024-7_1
Cortés, X., Serratosa, F., Riesen, K.: On the relevance of local neighbourhoods for greedy graph edit distance. In: Robles-Kelly, A., Loog, M., Biggio, B., Escolano, F., Wilson, R. (eds.) S+SSPR 2016. LNCS, vol. 10029, pp. 121–131. Springer, Cham (2016). doi:10.1007/978-3-319-49055-7_11
Serratosa, F., Cortés, X.: Graph edit distance: moving from global to local structure to solve the graph-matching problem. Pattern Recogn. Lett. 65, 204–210 (2015)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logistics Q. 2, 83–97 (1955)
Jonker, R., Volgenant, T.: Improving the Hungarian assignment algorithm. Oper. Res. Lett. 5(4), 171–175 (1986)
Ferrer, M., Serratosa, F., Riesen, K.: Improving bipartite graph matching by assessing the assignment confidence. Pattern Recogn. Lett. 65, 29–36 (2015)
Serratosa, F., Cortés, X., Moreno, C.-F.: Graph edit distance or graph edit pseudo-distance? In: Robles-Kelly, A., Loog, M., Biggio, B., Escolano, F., Wilson, R. (eds.) S+SSPR 2016. LNCS, vol. 10029, pp. 530–540. Springer, Cham (2016). doi:10.1007/978-3-319-49055-7_47
McAuley, J., Leskovec, J.: Learning to discover social circles in ego networks. In: NIPS 2012
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data (ACM TKDD), 1(1), 5–34 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Santacruz, P., Algabli, S., Serratosa, F. (2017). Node Matching Computation Between Two Large Graphs in Linear Computational Cost. In: Foggia, P., Liu, CL., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2017. Lecture Notes in Computer Science(), vol 10310. Springer, Cham. https://doi.org/10.1007/978-3-319-58961-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-58961-9_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58960-2
Online ISBN: 978-3-319-58961-9
eBook Packages: Computer ScienceComputer Science (R0)