{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:25:56Z","timestamp":1776281156024,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319490540","type":"print"},{"value":"9783319490557","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49055-7_44","type":"book-chapter","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T14:02:34Z","timestamp":1478268154000},"page":"496-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximating Graph Edit Distance Using GNCCP"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Ga\u00fcz\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Bougleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Brun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,5]]},"reference":[{"key":"44_CR1","unstructured":"Bougleux, S., Brun, L., Carletti, V., Foggia, P., Ga\u00fcz\u00e8re, B., Vento, M.: A quadratic assignment formulation of the graph edit distance. Technical report, Normandie Univ, NormaSTIC FR 3638, France (2015)"},{"issue":"4","key":"44_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recogn. Lett. 1(4), 245\u2013253 (1983)","journal-title":"Pattern Recogn. Lett."},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-319-18224-7_19","volume-title":"Graph-Based Representations in Pattern Recognition","author":"V Carletti","year":"2015","unstructured":"Carletti, V., Ga\u00fcz\u00e8re, B., Brun, L., Vento, M.: Approximate graph edit distance computation combining bipartite matching and exact neighborhood substructure distance. In: Liu, C.-L., Luo, B., Kropatsch, W.G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 188\u2013197. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-18224-7_19"},{"key":"44_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-662-44415-3_8","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"B Ga\u00fcz\u00e8re","year":"2014","unstructured":"Ga\u00fcz\u00e8re, B., Bougleux, S., Riesen, K., Brun, L.: Approximate graph edit distance guided by bipartite matching of bags of walks. In: Fr\u00e4nti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 73\u201382. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44415-3_8"},{"issue":"8","key":"44_CR5","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/TPAMI.2006.152","volume":"28","author":"D Justice","year":"2006","unstructured":"Justice, D., Hero, A.: A binary linear programming formulation of the graph edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 28(8), 1200\u20131214 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Res. Logist. Quat. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quat."},{"key":"44_CR7","unstructured":"Leordeanu, M., Hebert, M., Sukthankar, R.: An integer projected fixed point method for graph matching and map inference. In: Advances in Neural Information Processing Systems, pp. 1114\u20131122 (2009)"},{"key":"44_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-58325-4_168","volume-title":"Algorithms and Computation","author":"C-L Lin","year":"1994","unstructured":"Lin, C.-L.: Hardness of approximating graph transformation problem. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol. 834, pp. 74\u201382. Springer, Heidelberg (1994). doi:10.1007\/3-540-58325-4_168"},{"issue":"6","key":"44_CR9","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1109\/TPAMI.2013.223","volume":"36","author":"Z-Y Liu","year":"2014","unstructured":"Liu, Z.-Y., Qiao, H.: GNCCP-graduated NonConvexity and concavity procedure. Pattern Anal. Mach. Intell. 36(6), 1258\u20131267 (2014)","journal-title":"Pattern Anal. Mach. Intell."},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-72903-7_9","volume-title":"Graph-Based Representations in Pattern Recognition","author":"M Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: A quadratic programming approach to the graph edit distance problem. In: Escolano, F., Vento, M. (eds.) GbRPR 2007. LNCS, vol. 4538, pp. 92\u2013102. Springer, Heidelberg (2007)"},{"key":"44_CR11","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27, 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"key":"44_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-38221-5_15","volume-title":"Graph-Based Representations in Pattern Recognition","author":"K Riesen","year":"2013","unstructured":"Riesen, K., Emmenegger, S., Bunke, H.: A novel software toolkit for graph edit distance computation. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol. 7877, pp. 142\u2013151. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-38221-5_15"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Brun, L., Bougleux, S., Ga\u00fcz\u00e8re, B.: Graph edit distance as a quadratic program. In: ICPR (2016, submitted)","DOI":"10.1109\/ICPR.2016.7899881"},{"issue":"3","key":"44_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.-S.: A distance measure between attributed relational graphs for pattern recognition. Syst. Man Cybern. 13(3), 353\u2013362 (1983)","journal-title":"Syst. Man Cybern."},{"issue":"2","key":"44_CR15","doi-asserted-by":"publisher","first-page":"1550010","DOI":"10.1142\/S021800141550010X","volume":"29","author":"S Serratosa","year":"2015","unstructured":"Serratosa, S.: Speeding up fast bipartite graph matching through a new cost matrix. Int. J. Pattern Recogn. 29(2), 1550010 (2015)","journal-title":"Int. J. Pattern Recogn."},{"issue":"12","key":"44_CR16","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., Bach, F., Vert, J.-P.: A path following algorithm for the graph matching problem. Pattern Anal. Mach. Intell. 31(12), 2227\u20132242 (2009)","journal-title":"Pattern Anal. Mach. Intell."},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Zhou, F., De la Torre, F.: Factorized graph matching. In: CVPR, pp. 127\u2013134 (2012)","DOI":"10.1109\/CVPR.2013.376"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49055-7_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:05:03Z","timestamp":1710263103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-49055-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319490540","9783319490557"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49055-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"M\u00e9rida","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}