{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:03:19Z","timestamp":1758268999929,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319977843"},{"type":"electronic","value":"9783319977850"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97785-0_28","type":"book-chapter","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T14:49:17Z","timestamp":1533134957000},"page":"293-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Ring Based Approximation of Graph Edit Distance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8651-750X","authenticated-orcid":false,"given":"David B.","family":"Blumenthal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4581-7570","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Bougleux","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7128-507X","authenticated-orcid":false,"given":"Johann","family":"Gamper","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1658-0527","authenticated-orcid":false,"given":"Luc","family":"Brun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,2]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.patrec.2017.10.007","volume":"100","author":"Z Abu-Aisheh","year":"2017","unstructured":"Abu-Aisheh, Z., Ga\u00fczere, B., Bougleux, S., Ramel, J.Y., Brun, L., Raveaux, R., H\u00e9roux, P., Adam, S.: Graph edit distance contest 2016: results and future challenges. Pattern Recogn. Lett. 100, 96\u2013103 (2017). https:\/\/doi.org\/10.1016\/j.patrec.2017.10.007","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TKDE.2017.2772243","volume":"30","author":"DB Blumenthal","year":"2018","unstructured":"Blumenthal, D.B., Gamper, J.: Improved lower bounds for graph edit distance. IEEE Trans. Knowl. Data Eng. 30(3), 503\u2013516 (2018). https:\/\/doi.org\/10.1109\/TKDE.2017.2772243","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.05.002","author":"DB Blumenthal","year":"2018","unstructured":"Blumenthal, D.B., Gamper, J.: On the exact computation of the graph edit distance. Pattern Recogn. Lett. (2018). https:\/\/doi.org\/10.1016\/j.patrec.2018.05.002","journal-title":"Pattern Recogn. Lett."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.patrec.2016.10.001","volume":"87","author":"S Bougleux","year":"2017","unstructured":"Bougleux, S., Brun, L., Carletti, V., Foggia, P., Ga\u00fcz\u00e8re, B., Vento, M.: Graph edit distance as a quadratic assignment problem. Pattern Recogn. Lett. 87, 38\u201346 (2017). https:\/\/doi.org\/10.1016\/j.patrec.2016.10.001","journal-title":"Pattern Recogn. Lett."},{"key":"28_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.03.032","author":"S Bougleux","year":"2018","unstructured":"Bougleux, S., Ga\u00fcz\u00e8re, B., Blumenthal, D.B., Brun, L.: Fast linear sum assignment with error-correction and no cost constraints. Pattern Recogn. Lett. (2018). https:\/\/doi.org\/10.1016\/j.patrec.2018.03.032","journal-title":"Pattern Recogn. Lett."},{"key":"28_CR6","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18224-7_19"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-18224-7_8","volume-title":"Graph-Based Representations in Pattern Recognition","author":"M Ferrer","year":"2015","unstructured":"Ferrer, M., Serratosa, F., Riesen, K.: A first step towards exact graph edit distance using bipartite graph matching. In: Liu, C.-L., Luo, B., Kropatsch, W.G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 77\u201386. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18224-7_8"},{"key":"28_CR8","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). https:\/\/doi.org\/10.1007\/978-3-662-44415-3_8"},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Le Digabel","year":"2011","unstructured":"Le Digabel, S.: Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4), 44:1\u201344:15 (2011). https:\/\/doi.org\/10.1145\/1916461.1916468","journal-title":"ACM Trans. Math. Softw."},{"issue":"7","key":"28_CR10","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(7), 950\u2013959 (2009). https:\/\/doi.org\/10.1016\/j.imavis.2008.04.004","journal-title":"Image Vis. Comput."},{"issue":"4","key":"28_CR11","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1016\/j.patcog.2014.11.002","volume":"48","author":"K Riesen","year":"2015","unstructured":"Riesen, K., Bunke, H.: Improving bipartite graph edit distance approximation using various search strategies. Pattern Recogn. 48(4), 1349\u20131363 (2015). https:\/\/doi.org\/10.1016\/j.patcog.2014.11.002","journal-title":"Pattern Recogn."},{"doi-asserted-by":"publisher","unstructured":"Riesen, K., Bunke, H., Fischer, A.: Improving graph edit distance approximation by centrality measures. In: ICPR 2014, pp. 3910\u20133914. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/ICPR.2014.671","key":"28_CR12","DOI":"10.1109\/ICPR.2014.671"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-18224-7_1","volume-title":"Graph-Based Representations in Pattern Recognition","author":"K Riesen","year":"2015","unstructured":"Riesen, K., Ferrer, M., Fischer, A., Bunke, H.: Approximation of graph edit distance in quadratic time. In: Liu, C.-L., Luo, B., Kropatsch, W.G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 3\u201312. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18224-7_1"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-58961-9_20","volume-title":"Graph-Based Representations in Pattern Recognition","author":"K Riesen","year":"2017","unstructured":"Riesen, K., Fischer, A., Bunke, H.: Improved graph edit distance approximation with simulated annealing. In: Foggia, P., Liu, C.-L., Vento, M. (eds.) GbRPR 2017. LNCS, vol. 10310, pp. 222\u2013231. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58961-9_20"},{"issue":"3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Global Optim. 56(3), 1247\u20131293 (2013). https:\/\/doi.org\/10.1007\/s10898-012-9951-y","journal-title":"J. Global Optim."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.patrec.2015.08.003","volume":"65","author":"F Serratosa","year":"2015","unstructured":"Serratosa, F., Cort\u00e9s, X.: Graph edit distance: moving from global to local structure to solve the graph-matching problem. Pattern Recogn. Lett. 65, 204\u2013210 (2015). https:\/\/doi.org\/10.1016\/j.patrec.2015.08.003","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. PVLDB 2(1), 25\u201336 (2009). https:\/\/doi.org\/10.14778\/1687627.1687631","journal-title":"PVLDB"},{"issue":"4","key":"28_CR18","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/TKDE.2014.2349924","volume":"27","author":"W Zheng","year":"2015","unstructured":"Zheng, W., Zou, L., Lian, X., Wang, D., Zhao, D.: Efficient graph similarity search over large graph databases. IEEE Trans. Knowl. Data Eng. 27(4), 964\u2013978 (2015). https:\/\/doi.org\/10.1109\/TKDE.2014.2349924","journal-title":"IEEE Trans. Knowl. Data Eng."}],"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-97785-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:41:50Z","timestamp":1710348110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-97785-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319977843","9783319977850"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97785-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 August 2018","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":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ssspr2018.buaa.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}