{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:05:06Z","timestamp":1725570306012},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404088"},{"type":"electronic","value":"9783540449898"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44989-2_36","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T17:10:02Z","timestamp":1290186602000},"page":"299-306","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Neural Network Approach to Solve Exact and Inexact Graph Isomorphism Problems"],"prefix":"10.1007","author":[{"given":"Brijnesh J.","family":"Jain","sequence":"first","affiliation":[]},{"given":"Fritz","family":"Wysotzki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"issue":"3","key":"36_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01259368","volume":"1","author":"M. Abdulrahim","year":"1998","unstructured":"M. Abdulrahim and M. Misra. A graph isomorphism algorithm for object recognition. Pattern Analysis and Application, 1(3):189\u2013201, 1998.","journal-title":"Pattern Analysis and Application"},{"key":"36_CR2","first-page":"298","volume-title":"International Joint Conference on Artificial Intelligence","author":"A.P. Ambler","year":"1973","unstructured":"A.P. Ambler, H.G. Barrow, C.M. Brown, R.M. Burstall, and R. J. Popplestone. A versatile computer-controlled assembly system. In International Joint Conference on Artificial Intelligence, pages 298\u2013307. Stanford University, California, 1973."},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1137\/0209047","volume":"9","author":"L. Babai","year":"1980","unstructured":"L. Babai, P. Erd\u00f6s, and S. Selkow. Random graph isomorphism. SIAM Journal on Computing, 9:628\u2013635, 1980.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"36_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0209025","volume":"9","author":"D.G. Corneil","year":"1980","unstructured":"D.G. Corneil and D.G. Kirkpatrick. A theoretical analysis of various heuristics for the graph isomorphism problem. SIAM Journal of Computing, 9(2):281\u2013297, 1980.","journal-title":"SIAM Journal of Computing"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"B.J. Jain and F. Wysotzki. Fast winner-takes-all networks for the maximum clique problem. In 25th German Conference on Artificial Intelligence, pages 163\u2013173. Springer, 2002.","DOI":"10.1007\/3-540-45751-8_11"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1021\/c160017a018","volume":"5","author":"H.L. Morgan","year":"1965","unstructured":"H.L. Morgan. The generation of a unique machine description for chemical structures. Journal of Chemical Documentation, 5:107\u2013112, 1965.","journal-title":"Journal of Chemical Documentation"},{"issue":"8","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1162\/089976699300016034","volume":"11","author":"M. Pelillo","year":"1999","unstructured":"M. Pelillo. Replicator equations, maximal cliques, and graph isomorphism. Neural Computation, 11(8):1933\u20131955, 1999.","journal-title":"Neural Computation"},{"issue":"11","key":"36_CR8","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1109\/34.809105","volume":"21","author":"M. Pelillo","year":"1999","unstructured":"M. Pelillo, K. Siddiqi, and S.W. Zucker. Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(11):1105\u20131120, 1999.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"5","key":"36_CR9","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1162\/neco.1996.8.5.1041","volume":"8","author":"A. Rangarajan","year":"1996","unstructured":"A. Rangarajan, S. Gold, and E. Mjolsness. A novel optimizing network architecture with applications. Neural Computation, 8(5):1041\u20131060, 1996.","journal-title":"Neural Computation"},{"issue":"6","key":"36_CR10","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1109\/72.548165","volume":"7","author":"A. Rangarajan","year":"1996","unstructured":"A. Rangarajan and E. Mjolsness. A Lagrangian relaxation network for graph matching. IEEE Transactions on Neural Networks, 7(6):1365\u20131381, 1996.","journal-title":"IEEE Transactions on Neural Networks"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Neural Information Processing \u2014 ICANN\/ICONIP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44989-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T18:25:59Z","timestamp":1551119159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44989-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404088","9783540449898"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44989-2_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}