{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:25:54Z","timestamp":1776281154967,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"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_43","type":"book-chapter","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T14:02:34Z","timestamp":1478268154000},"page":"485-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Exact Graph Edit Distance Computation Using a Binary Linear Program"],"prefix":"10.1007","author":[{"given":"Julien","family":"Lerouge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeina","family":"Abu-Aisheh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romain","family":"Raveaux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"H\u00e9roux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Adam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,5]]},"reference":[{"issue":"6","key":"43_CR1","first-page":"1250013","volume":"26","author":"S Fankhauser","year":"2012","unstructured":"Fankhauser, S., Riesen, K., Bunke, H., Dickinson, P.J.: Suboptimal graph isomorphism using bipartite matching. IJPRAI 26(6), 1250013 (2012)","journal-title":"IJPRAI"},{"key":"43_CR2","unstructured":"Fischer, A., Bunke, H.: Character prototype selection for handwriting recognition in historical documents. In: 2011 19th European Signal Processing Conference, pp. 1435\u20131439, August 2011"},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-662-44415-3_9","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"A Fischer","year":"2014","unstructured":"Fischer, A., Plamondon, R., Savaria, Y., Riesen, K., Bunke, H.: A hausdorff heuristic for efficient computation of graph edit distance. In: Fr\u00e4nti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 83\u201392. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44415-3_9"},{"issue":"2","key":"43_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.patcog.2014.07.015","volume":"48","author":"A Fischer","year":"2015","unstructured":"Fischer, A., Suen, C.Y., Frinken, V., Riesen, K., Bunke, H.: Approximation of graph edit distance based on Hausdorff matching. Pattern Recogn. 48(2), 331\u2013343 (2015)","journal-title":"Pattern Recogn."},{"issue":"15","key":"43_CR5","doi-asserted-by":"publisher","first-page":"2038","DOI":"10.1016\/j.patrec.2012.03.020","volume":"33","author":"B Ga\u00fcz\u00e8re","year":"2012","unstructured":"Ga\u00fcz\u00e8re, B., Brun, L., Villemin, D.: Two new graphs kernels in chemoinformatics. Pattern Recogn. Lett. 33(15), 2038\u20132047 (2012). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S016786551200102X, Graph-Based Representations in Pattern Recognition","journal-title":"Pattern Recogn. Lett."},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Hammami, M., H\u00e9roux, P., Adam, S., d\u2019Andecy, V.P.: One-shot field spotting on colored forms using subgraph isomorphism. In: 2015 13th International Conference on Document Analysis and Recognition (ICDAR), pp. 586\u2013590, August 2015","DOI":"10.1109\/ICDAR.2015.7333829"},{"issue":"2","key":"43_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-44854-0_19","volume-title":"Graphics Recognition. Current Trends and Challenges","author":"P H\u00e9roux","year":"2014","unstructured":"H\u00e9roux, P., Bodic, P., Adam, S.: Datasets for the evaluation of substitution-tolerant subgraph isomorphism. In: Lamiroy, B., Ogier, J.-M. (eds.) GREC 2013. LNCS, vol. 8746, pp. 240\u2013251. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44854-0_19"},{"issue":"8","key":"43_CR9","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."},{"issue":"5","key":"43_CR10","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1007\/s10618-014-0367-9","volume":"28","author":"O Kostakis","year":"2014","unstructured":"Kostakis, O.: Classy: fast clustering streams of call-graphs. Data Min. Knowl. Discov. 28(5), 1554\u20131585 (2014). doi:10.1007\/s10618-014-0367-9","journal-title":"Data Min. Knowl. Discov."},{"issue":"12","key":"43_CR11","doi-asserted-by":"publisher","first-page":"4214","DOI":"10.1016\/j.patcog.2012.05.022","volume":"45","author":"P Le Bodic","year":"2012","unstructured":"Le Bodic, P., H\u00e9roux, P., Adam, S., Lecourtier, Y.: An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings. Pattern Recogn. 45(12), 4214\u20134224 (2012)","journal-title":"Pattern Recogn."},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.patrec.2015.11.026","volume":"71","author":"J Lerouge","year":"2016","unstructured":"Lerouge, J., Hammami, M., H\u00e9roux, P., Adam, S.: Minimum cost subgraph matching using a binary linear program. Pattern Recogn. Lett. 71, 45\u201351 (2016)","journal-title":"Pattern Recogn. Lett."},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-319-18224-7_13","volume-title":"Graph-Based Representations in Pattern Recognition","author":"J Lerouge","year":"2015","unstructured":"Lerouge, J., Bodic, P., H\u00e9roux, P., Adam, S.: GEM++: a tool for solving substitution-tolerant subgraph isomorphism. In: Liu, C.-L., Luo, B., Kropatsch, W.G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 128\u2013137. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-18224-7_13"},{"issue":"6","key":"43_CR14","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/34.862201","volume":"22","author":"R Myers","year":"2000","unstructured":"Myers, R., Wilson, R.C., Hancock, E.R.: Bayesian graph edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 22(6), 628\u2013635 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"43_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11815921_17","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"M Neuhaus","year":"2006","unstructured":"Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., Ridder, D. (eds.) SSPR \/SPR 2006. LNCS, vol. 4109, pp. 163\u2013172. Springer, Heidelberg (2006). doi:10.1007\/11815921_17"},{"issue":"5","key":"43_CR16","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.patrec.2009.10.011","volume":"31","author":"R Raveaux","year":"2010","unstructured":"Raveaux, R., Burie, J.C., Ogier, J.M.: A graph matching method and a graph matching distance based on subgraph assignments. Pattern Recogn. Lett. 31(5), 394\u2013406 (2010)","journal-title":"Pattern Recogn. Lett."},{"key":"43_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) Structural, Syntactic, and Statistical Pattern Recognition. LNCS, vol. 5342, pp. 287\u2013297. Springer, Heidelberg (2008)"},{"issue":"7","key":"43_CR18","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)","journal-title":"Image Vis. Comput."},{"key":"43_CR19","doi-asserted-by":"publisher","DOI":"10.1142\/7731","volume-title":"Graph Classification and Clustering Based on Vector Space Embedding","author":"K Riesen","year":"2010","unstructured":"Riesen, K., Bunke, H.: Graph Classification and Clustering Based on Vector Space Embedding. World Scientific Publishing Co. Inc., River Edge (2010)"},{"issue":"4","key":"43_CR20","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)","journal-title":"Pattern Recogn."},{"key":"43_CR21","unstructured":"Riesen, K., Fankhauser, S., Bunke, H.: Speeding up graph edit distance computation with a bipartite heuristic. In: Frasconi, P., Kersting, K., Tsuda, K. (eds.) Mining and Learning with Graphs, MLG 2007, Firence, Italy, 1\u20133 August 2007, Proceedings (2007)"},{"key":"43_CR22","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 Endowment. 2, 25\u201336 (2009)","journal-title":"Proc. VLDB Endowment."}],"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_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:04:53Z","timestamp":1710263093000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-49055-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319490540","9783319490557"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49055-7_43","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"}]}}