{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:13:20Z","timestamp":1758266000534},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444146"},{"type":"electronic","value":"9783662444153"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44415-3_8","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T04:40:31Z","timestamp":1407904831000},"page":"73-82","source":"Crossref","is-referenced-by-count":15,"title":["Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks"],"prefix":"10.1007","author":[{"given":"Benoit","family":"Ga\u00fcz\u00e8re","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Bougleux","sequence":"additional","affiliation":[]},{"given":"Kaspar","family":"Riesen","sequence":"additional","affiliation":[]},{"given":"Luc","family":"Brun","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"8_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H. Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters\u00a018(9), 689\u2013694 (1997)","journal-title":"Pattern Recognition Letters"},{"key":"8_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 Recognition Letters\u00a01, 245\u2013253 (1983)","journal-title":"Pattern Recognition Letters"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems. SIAM (2009)","DOI":"10.1137\/1.9780898717754"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Hanbook of Product Graphs, 2nd edn. Discrete Mathematics and its Applications. CRC Press, Taylor & Francis (2011)","DOI":"10.1201\/b10959"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quaterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistics Quaterly"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J. Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics\u00a05(1), 32\u201338 (1957)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"8_CR7","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 and Vision Computing\u00a027, 950\u2013959 (2009)","journal-title":"Image and Vision Computing"},{"key":"8_CR8","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.\u00a07877, pp. 142\u2013151. Springer, Heidelberg (2013)"},{"issue":"3","key":"8_CR9","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.: A distance measure between attributed relational graphs for pattern recognition. Systems, Man and Cybernetics\u00a013(3), 353\u2013363 (1983)","journal-title":"Systems, Man and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44415-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:24:43Z","timestamp":1558970683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44415-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444146","9783662444153"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44415-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}