{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:35:33Z","timestamp":1742996133511,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_44","type":"book-chapter","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T14:49:17Z","timestamp":1533134957000},"page":"460-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximating GED Using a Stochastic Generator and Multistart IPFP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0548-4257","authenticated-orcid":false,"given":"Nicolas","family":"Boria","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-1658-0527","authenticated-orcid":false,"given":"Luc","family":"Brun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,2]]},"reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-319-18224-7_14","volume-title":"Graph-Based Representations in Pattern Recognition","author":"Z Abu-Aisheh","year":"2015","unstructured":"Abu-Aisheh, Z., Raveaux, R., Ramel, J.-Y.: A graph database repository and performance evaluation metrics for graph edit distance. In: Liu, C.-L., Luo, B., Kropatsch, W.G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 138\u2013147. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18224-7_14"},{"key":"44_CR2","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., et al.: Graph edit distance contest: 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."},{"key":"44_CR3","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. Patt. Recogn. Lett. 87, 38\u201346 (2017). https:\/\/doi.org\/10.1016\/j.patrec.2016.10.001","journal-title":"Patt. Recogn. Lett."},{"key":"44_CR4","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":"44_CR5","doi-asserted-by":"publisher","unstructured":"Daller, E., Bougleux, S., Ga\u00fcz\u00e8re, B., Brun, L.: Approximate graph edit distance from several assignments and multiple IPFP. In: International Conference on Pattern Recognition Applications and Methods (2018). https:\/\/doi.org\/10.5220\/0006599901490158","DOI":"10.5220\/0006599901490158"},{"key":"44_CR6","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"},{"issue":"1\u20132","key":"44_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"key":"44_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-319-49055-7_44","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"B Ga\u00fcz\u00e8re","year":"2016","unstructured":"Ga\u00fcz\u00e8re, B., Bougleux, S., Brun, L.: Approximating graph edit distance using GNCCP. In: Robles-Kelly, A., Loog, M., Biggio, B., Escolano, F., Wilson, R. (eds.) S+SSPR 2016. LNCS, vol. 10029, pp. 496\u2013506. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49055-7_44"},{"key":"44_CR9","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). https:\/\/doi.org\/10.1016\/j.imavis.2008.04.004","journal-title":"Image Vis. Comput."},{"issue":"4","key":"44_CR10","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."},{"key":"44_CR11","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":"44_CR12","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. IEEE Trans. Syst. Man Cybern. 13(3), 353\u2013362 (1983). https:\/\/doi.org\/10.1109\/TSMC.1983.6313167","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1039\/C7SC02664A","volume":"9","author":"Z Wu","year":"2018","unstructured":"Wu, Z., et al.: MoleculeNet: a benchmark for molecular machine learning. Chem. Sci. 9, 513\u2013530 (2018). https:\/\/doi.org\/10.1039\/C7SC02664A","journal-title":"Chem. Sci."},{"issue":"1","key":"44_CR14","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. Proc. VLDB Endow. 2(1), 25\u201336 (2009). https:\/\/doi.org\/10.14778\/1687627.1687631","journal-title":"Proc. VLDB Endow."}],"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_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:43:50Z","timestamp":1710348230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-97785-0_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319977843","9783319977850"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97785-0_44","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"}}]}}