{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:55:24Z","timestamp":1773482124592,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642382208","type":"print"},{"value":"9783642382215","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38221-5_15","type":"book-chapter","created":{"date-parts":[[2013,5,6]],"date-time":"2013-05-06T00:48:12Z","timestamp":1367801292000},"page":"142-151","source":"Crossref","is-referenced-by-count":52,"title":["A Novel Software Toolkit for Graph Edit Distance Computation"],"prefix":"10.1007","author":[{"given":"Kaspar","family":"Riesen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandro","family":"Emmenegger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst","family":"Bunke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","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"},{"issue":"10","key":"15_CR2","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1016\/S0031-3203(03)00084-0","volume":"36","author":"B. Luo","year":"2003","unstructured":"Luo, B., Wilson, R., Hancock, E.R.: Spectral embedding of graphs. Pattern Recognition\u00a036(10), 2213\u20132223 (2003)","journal-title":"Pattern Recognition"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Wilson, R., Hancock, E.R.: Levenshtein distance for graph spectral features. In: Kittler, J., Petrou, M., Nixon, M. (eds.) Proc. 17th Int. Conf. on Pattern Recognition, vol.\u00a02, pp. 489\u2013492 (2004)","DOI":"10.1109\/ICPR.2004.1334272"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-24838-5_8","volume-title":"Experimental and Efficient Algorithms","author":"M.C. Boeres","year":"2004","unstructured":"Boeres, M.C., Ribeiro, C.C., Bloch, I.: A randomized heuristic for scene recognition by graph matching. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 100\u2013113. Springer, Heidelberg (2004)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-31988-7_16","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S. Sorlin","year":"2005","unstructured":"Sorlin, S., Solnon, C.: Reactive tabu search for measuring graph similarity. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol.\u00a03434, pp. 172\u2013182. Springer, Heidelberg (2005)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-27868-9_18","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"M. Neuhaus","year":"2004","unstructured":"Neuhaus, M., Bunke, H.: An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol.\u00a03138, pp. 180\u2013189. Springer, Heidelberg (2004)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-45028-9_9","volume-title":"Graph Based Representations in Pattern Recognition","author":"R. Ambauen","year":"2003","unstructured":"Ambauen, R., Fischer, S., Bunke, H.: Graph edit distance with node splitting and merging and its application to diatom identification. In: Hancock, E., Vento, M. (eds.) GbRPR 2003. LNCS, vol.\u00a02726, pp. 95\u2013106. Springer, Heidelberg (2003)"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A. Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.R.: Graph edit distance from spectral seriation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a027(3), 365\u2013378 (2005)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"15_CR9","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 Transactions of Systems, Science, and Cybernetics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions of Systems, Science, and Cybernetics"},{"key":"15_CR10","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.) Proc. 5th. Int. Workshop on Mining and Learning with Graphs, pp. 21\u201324 (2007)"},{"key":"15_CR11","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":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72903-7_1","volume-title":"Graph-Based Representations in Pattern Recognition","author":"K. Riesen","year":"2007","unstructured":"Riesen, K., Neuhaus, M., Bunke, H.: Bipartite graph matching for computing the edit distance of graphs. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol.\u00a04538, pp. 1\u201312. Springer, Heidelberg (2007)"},{"issue":"4","key":"15_CR13","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"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-20844-7_11","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S. Fankhauser","year":"2011","unstructured":"Fankhauser, S., Riesen, K., Bunke, H.: Speeding up graph edit distance computation through fast bipartite matching. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol.\u00a06658, pp. 102\u2013111. Springer, Heidelberg (2011)"},{"key":"15_CR15","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, 32\u201338 (1957)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, T.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing\u00a038, 325\u2013340 (1987)","journal-title":"Computing"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf, B., Smola, A.: Learning with Kernels. MIT Press (2002)","DOI":"10.7551\/mitpress\/4175.001.0001"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511809682"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Neuhaus, M., Bunke, H.: Bridging the Gap Between Graph Edit Distance and Kernel Machines. World Scientific (2007)","DOI":"10.1142\/6523"},{"issue":"4","key":"15_CR20","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1109\/TPAMI.2005.78","volume":"27","author":"B. Haasdonk","year":"2005","unstructured":"Haasdonk, B.: Feature space interpretation of SVMs with indefinite kernels. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a027(4), 482\u2013492 (2005)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"15_CR21","unstructured":"Cs\u00e1rdi, G., Nepusz, T.: The igraph software package for complex network research. Inter. Journal Complex Systems\u00a01695 (2006)"},{"key":"15_CR22","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: Proc. of the 3rd IAPR TC-15 Workshop on Graphbased Representations in Pattern Recognition, pp. 149\u2013159 (2001)"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-02124-4_13","volume-title":"Graph-Based Representations in Pattern Recognition","author":"K. Riesen","year":"2009","unstructured":"Riesen, K., Fankhauser, S., Bunke, H., Dickinson, P.: Efficient suboptimal graph isomorphism. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol.\u00a05534, pp. 124\u2013133. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38221-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:42:21Z","timestamp":1746002541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38221-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382208","9783642382215"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38221-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}