{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:31:12Z","timestamp":1725640272503},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615859"},{"type":"electronic","value":"9783642802942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/978-3-642-80294-2_34","type":"book-chapter","created":{"date-parts":[[2011,12,7]],"date-time":"2011-12-07T00:58:09Z","timestamp":1323219489000},"page":"323-330","source":"Crossref","is-referenced-by-count":0,"title":["Erweiterte diskrete Relaxationsalgorithmen zum Subgraph-Isomorphie-Problem"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Voss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"34_CR1","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/TSMC.1986.289319","volume":"16","author":"FA Akinniyi","year":"1986","unstructured":"F. A. Akinniyi, A. Wong, and D. A. Stacey. A new algorithm for graph monomorphism based on the projections of the product graph. IEEE Transactions on Systems, Man and Cybernetics, 16 (5): 740\u2013751, 1986.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"34_CR2","first-page":"3","volume":"20","author":"AT Berztiss","year":"1992","unstructured":"A. T. Berztiss. A backtrack procedure for isomorphism of directed graphs. Journal of the ACM, 20 (3), 1973.","journal-title":"Journal of the ACM"},{"issue":"2","key":"34_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0031-3203(95)00089-5","volume":"29","author":"L Cinque","year":"1996","unstructured":"L. Cinque, D. Yasuda, G. Shapiro, S. Tanimoto, and B. Allen. An improved algorithm for relational distance graph matching. Pattern Recognition, 29 (2): 349\u2013359, 1996.","journal-title":"Pattern Recognition"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/321556.321562","volume":"17","author":"C Gottlieb","year":"1970","unstructured":"C. Gottlieb D. Corneil. An efficient algorithm for graph isomorphism. Journal of the ACM, 17 (1): 51\u201364, 1970.","journal-title":"Journal of the ACM"},{"key":"34_CR5","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completnes","author":"MR Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completnes. Freeman, San Francisco, CA, 1979."},{"key":"34_CR6","first-page":"189","volume":"10","author":"DE Ghahraman","year":"1992","unstructured":"D. E. Ghahraman, A. K. C. Wang, and T. Au. Graph monomorphism algorithms. IEEE Trans. Systems. Man Cybernet, SMC-10. 189\u2013196, 1980.","journal-title":"IEEE Trans. Systems. Man Cybernet"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"R. M. Haralick and G. L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14: 263\u2013313, 1980.","journal-title":"Artificial Intelligence"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0734-189X(84)80016-X","volume":"28","author":"TC Henderson","year":"1984","unstructured":"T. C. Henderson. A note on discrete relaxation. Computer Vision, Graphics and Image Processing, 28: 384\u2013388, 1984.","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/800119.803896","volume-title":"Annual ACM Symposium on Theory of Computing","author":"JE Hopcroft","year":"1974","unstructured":"J. E. Hopcroft and J. K. Wong. Linear time algorithm for isomophism of planar graphs. In Annual ACM Symposium on Theory of Computing, pages 172\u2013184, 1974."},{"key":"34_CR10","volume-title":"A network based approach to exact and inexact graph matching","author":"BT Messner","year":"1993","unstructured":"B. T. Messner and H. Buiike. A network based approach to exact and inexact graph matching. Technical report, Institut f\u00fcr Informatik und angewandte Mathematik, Universit\u00e4t Bern, 1993."},{"key":"34_CR11","volume-title":"Subgraph isomorphism in polynomial time","author":"BT Messner","year":"1995","unstructured":"B. T. Messner and H. Bunke. Subgraph isomorphism in polynomial time. Technical report, Institut f\u00fcr Informatik und angewandte Mathematik, University of Bern, Switzerland, 1995."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1145\/321958.321963","volume":"23","author":"DC Schmidt","year":"1976","unstructured":"D. C. Schmidt. A feist backtracking algorithm to test directed graphs for isomorphism using distance matrices. Journal of the ACM, 23: 433\u2013445, 1976.","journal-title":"Journal of the ACM"},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/128762.128763","volume":"24","author":"P Suetens","year":"1992","unstructured":"P. Suetens, P. Fua, and J. A. Hannson. Computational strategies for object recognition. ACM Computing Surveys, 24 (1): 5\u201361, 1992.","journal-title":"ACM Computing Surveys"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullman","year":"1976","unstructured":"J. R. Ullman. An algorithm for subgraph isomorphism. Journal of the ACM, 23: 31\u201342, 1976.","journal-title":"Journal of the ACM"},{"issue":"1","key":"34_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/363872.363899","volume":"7","author":"SH Unger","year":"1964","unstructured":"S. H. Unger. Git - a heuristic program for testing pairs of directed line graphs for isomorphism. Commun. ACM, 7 (l): 26\u201334, 1964.","journal-title":"Commun. ACM"}],"container-title":["Informatik aktuell","Mustererkennung 1996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-80294-2_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T18:14:56Z","timestamp":1606414496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-80294-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615859","9783642802942"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-80294-2_34","relation":{},"ISSN":["1431-472X"],"issn-type":[{"type":"print","value":"1431-472X"}],"subject":[],"published":{"date-parts":[[1996]]}}}