{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T10:18:36Z","timestamp":1756894716401},"publisher-location":"Berlin, Heidelberg","reference-count":27,"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_9","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T04:40:31Z","timestamp":1407904831000},"page":"83-92","source":"Crossref","is-referenced-by-count":8,"title":["A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Fischer","sequence":"first","affiliation":[]},{"given":"R\u00e9jean","family":"Plamondon","sequence":"additional","affiliation":[]},{"given":"Yvon","family":"Savaria","sequence":"additional","affiliation":[]},{"given":"Kaspar","family":"Riesen","sequence":"additional","affiliation":[]},{"given":"Horst","family":"Bunke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. Journal of Pattern Recognition and Artificial Intelligence\u00a018(3), 265\u2013298 (2004)","journal-title":"Int. Journal of Pattern Recognition and Artificial Intelligence"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38221-5_1","volume-title":"Graph-Based Representations in Pattern Recognition","author":"M. Vento","year":"2013","unstructured":"Vento, M.: A one hour trip in the world of graphs, looking at the papers of the last ten years. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol.\u00a07877, pp. 1\u201310. Springer, Heidelberg (2013)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1093\/bioinformatics\/bti1007","volume":"21","author":"K. Borgwardt","year":"2005","unstructured":"Borgwardt, K., Ong, C., Sch\u00f6nauer, S., Vishwanathan, S., Smola, A., Kriegel, H.P.: Protein function prediction via graph kernels. Bioinformatics\u00a021(1), 47\u201356 (2005)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Harchaoui, Z., Bach, F.: Image classification with segmentation graph kernels. In: Proc. Int. Conf. on Computer Vision and Pattern Recognition, pp. 1\u20138 (2007)","key":"9_CR4","DOI":"10.1109\/CVPR.2007.383049"},{"issue":"1-2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1142\/S0219265902000562","volume":"3","author":"P. Shoubridge","year":"2002","unstructured":"Shoubridge, P., Kraetzl, M., Wallis, W.D., Bunke, H.: Detection of abnormal change in time series of graphs. Journal of Interconnection Networks\u00a03(1-2), 85\u2013101 (2002)","journal-title":"Journal of Interconnection Networks"},{"issue":"5","key":"9_CR6","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a010(5), 695\u2013703 (1988)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"7","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TPAMI.2005.145","volume":"27","author":"R. Wilson","year":"2005","unstructured":"Wilson, R., Hancock, E., Luo, B.: Pattern vectors from algebraic graph theory. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a027(7), 1112\u20131124 (2005)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"17","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/S0031-3203(98)00145-9","volume":"32","author":"X. Jiang","year":"1999","unstructured":"Jiang, X., Bunke, H.: Optimal quadratic-time isomorphism of ordered graphs. Pattern Recognition\u00a032(17), 1273\u20131283 (1999)","journal-title":"Pattern Recognition"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10044-004-0222-5","volume":"7","author":"P. Dickinson","year":"2004","unstructured":"Dickinson, P., Bunke, H., Dadej, A., Kraetzl, M.: Matching graphs with unique node labels. Pattern Analysis and Applications\u00a07(3), 243\u2013254 (2004)","journal-title":"Pattern Analysis and Applications"},{"issue":"3","key":"9_CR10","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. on Systems, Man, and Cybernetics\u00a013(3), 353\u2013363 (1983)","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the Association for Computing Machinery\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. on Systems, Science, and Cybernetics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. on Systems, Science, and Cybernetics"},{"issue":"10","key":"9_CR13","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1109\/34.954600","volume":"23","author":"S. Berretti","year":"2001","unstructured":"Berretti, S., Del Bimbo, A., Vicario, E.: Efficient matching and indexing of graph models in content-based retrieval. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a023(10), 1089\u20131105 (2001)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-70659-3_19","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"L. Gregory","year":"2002","unstructured":"Gregory, L., Kittler, J.: Using graph search techniques for contextual colour retrieval. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SSPR&SPR 2002. LNCS, vol.\u00a02396, pp. 186\u2013194. Springer, Heidelberg (2002)"},{"unstructured":"Riesen, K., Fankhauser, S., Bunke, H.: Speeding up graph edit distance computation with a bipartite heuristic. In: Proc. Int. Workshop on Mining and Learning with Graphs, pp. 21\u201324 (2007)","key":"9_CR15"},{"issue":"4","key":"9_CR16","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(4), 950\u2013959 (2009)","journal-title":"Image and Vision Computing"},{"issue":"1","key":"9_CR17","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":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-38221-5_21","volume-title":"Graph-Based Representations in Pattern Recognition","author":"A. Fischer","year":"2013","unstructured":"Fischer, A., Suen, C.Y., Frinken, V., Riesen, K., Bunke, H.: A fast matching algorithm for graph-based handwriting recognition. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol.\u00a07877, pp. 194\u2013203. Springer, Heidelberg (2013)"},{"unstructured":"Fischer, A., Suen, C., Frinken, V., Riesen, K., Bunke, H.: Approximation of graph edit distance based on Hausdorff matching. Pattern Recognition (submitted)","key":"9_CR19"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1109\/34.232073","volume":"15","author":"D.P. Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Klanderman, G.A., Kl, G.A., Rucklidge, W.J.: Comparing images using the Hausdorff distance. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a015, 850\u2013863 (1993)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"8","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1929","DOI":"10.1162\/089976602760128072","volume":"14","author":"J.M. Coughlan","year":"2002","unstructured":"Coughlan, J.M., Yuille, A.L.: Bayesian A* tree search with expected O(N) node expansions: applications to road tracking. Neural Computation\u00a014(8), 1929\u20131958 (2002)","journal-title":"Neural Computation"},{"issue":"9","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1869","DOI":"10.1016\/S0031-3203(01)00150-9","volume":"35","author":"M. Cazorla","year":"2002","unstructured":"Cazorla, M., Escolano, F., Gallardo, D., Rizo, R.: Junction detection and grouping with probabilistic edge models and Bayesian A*. Pattern Recognition\u00a035(9), 1869\u20131881 (2002)","journal-title":"Pattern Recognition"},{"key":"9_CR23","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., de Ridder, D. (eds.) SSPR&SPR 2006. LNCS, vol.\u00a04109, pp. 163\u2013172. Springer, Heidelberg (2006)"},{"key":"9_CR24","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.) SSPR&SPR 2008. LNCS, vol.\u00a05342, pp. 287\u2013297. Springer, Heidelberg (2008)"},{"unstructured":"Watson, C., Wilson, C.: NIST Special Database 4, Fingerprint Database. National Institute of Standards and Technology (1992)","key":"9_CR25"},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1021\/jm040835a","volume":"48","author":"J. Kazius","year":"2005","unstructured":"Kazius, J., McGuire, R., Bursi, R.: Derivation and validation of toxicophores for mutagenicity prediction. Journal of Medicinal Chemistry\u00a048(1), 312\u2013320 (2005)","journal-title":"Journal of Medicinal Chemistry"},{"unstructured":"DTP: AIDS antiviral screen (2004), \n                    \n                      http:\/\/dtp.nci.nih.gov\/docs\/aids\/aids_data.html","key":"9_CR27"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:36:01Z","timestamp":1558971361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44415-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444146","9783662444153"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44415-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}