{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,16]],"date-time":"2026-11-16T21:21:56Z","timestamp":1794864116269,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540372363","type":"print"},{"value":"9783540372417","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11815921_17","type":"book-chapter","created":{"date-parts":[[2006,8,8]],"date-time":"2006-08-08T14:01:38Z","timestamp":1155045698000},"page":"163-172","source":"Crossref","is-referenced-by-count":140,"title":["Fast Suboptimal Algorithms for the Computation of Graph Edit Distance"],"prefix":"10.1007","author":[{"given":"Michel","family":"Neuhaus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaspar","family":"Riesen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Horst","family":"Bunke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","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. IEEE Transactions on Systems, Man, and Cybernetics (Part B)\u00a013, 353\u2013363 (1983)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics (Part B)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Hopcroft, J., Wong, J.: Linear time algorithm for isomorphism of planar graphs. In: Proc. 6th Annual ACM Symposium on Theory of Computing, pp. 172\u2013184 (1974)","DOI":"10.1145\/800119.803896"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E. Luks","year":"1982","unstructured":"Luks, E.: Isomorphism of graphs of bounded valence can be tested in ploynomial time. Journal of Computer and Systems Sciences\u00a025, 42\u201365 (1982)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/TPAMI.2005.146","volume":"27","author":"A. Torsello","year":"2005","unstructured":"Torsello, A., Hidovic-Rowe, D., Pelillo, M.: Polynomial-time metrics for attributed trees. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a027, 1087\u20131099 (2005)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45028-9_2","volume-title":"Graph Based Representations in Pattern Recognition","author":"P. Dickinson","year":"2003","unstructured":"Dickinson, P., Bunke, H., Dadej, A., Kraetzl, M.: On graphs with unique node labels. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol.\u00a02726, pp. 13\u201323. Springer, Heidelberg (2003)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/S0031-3203(96)00123-9","volume":"30","author":"A. Cross","year":"1997","unstructured":"Cross, A., Wilson, R., Hancock, E.: Inexact graph matching using genetic search. Pattern Recognition\u00a030, 953\u2013970 (1997)","journal-title":"Pattern Recognition"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/34.400565","volume":"17","author":"W. Christmas","year":"1995","unstructured":"Christmas, W., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a017, 749\u2013764 (1995)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"17_CR8","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":"17_CR9","unstructured":"Hlaoui, A., Wang, S.: A node-mapping-based algorithm for graph matching (to appear, 2006)"},{"key":"17_CR10","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 Transactions of Systems, Science, and Cybernetics\u00a04, 100\u2013107 (1968)","journal-title":"IEEE Transactions of Systems, Science, and Cybernetics"},{"key":"17_CR11","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":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/11492542_19","volume-title":"Pattern Recognition and Image Analysis","author":"B. Saux Le","year":"2005","unstructured":"Le Saux, B., Bunke, H.: Feature selection for graph-based image classifiers. In: Marques, J.S., P\u00e9rez de la Blanca, N., Pina, P. (eds.) IbPRIA 2005. LNCS, vol.\u00a03523, pp. 147\u2013154. Springer, Heidelberg (2005)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11527923_20","volume-title":"Audio- and Video-Based Biometric Person Authentication","author":"M. Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: A graph matching based approach to fingerprint classification using directional variance. In: Kanade, T., Jain, A., Ratha, N.K. (eds.) AVBPA 2005. LNCS, vol.\u00a03546, pp. 191\u2013200. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11815921_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:10:59Z","timestamp":1558271459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11815921_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372363","9783540372417"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11815921_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11815921","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}