{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T01:40:33Z","timestamp":1737596433726,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402107"},{"type":"electronic","value":"9783540448686"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44868-3_44","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T19:49:24Z","timestamp":1196365764000},"page":"342-349","source":"Crossref","is-referenced-by-count":1,"title":["Neural Implementation of Dijkstra\u2019s Algorithm."],"prefix":"10.1007","author":[{"given":"E.","family":"M\u00e9rida-Casermeiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Mu\u00f1oz-P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ben\u00edtez-Rochel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1109\/72.286889","volume":"4","author":"M.K.M. Ali","year":"1993","unstructured":"Ali M.K.M. and Kamoun F. Neural Networks for shortest path computation and routing in computer networks. IEEE Trans. N.N. 4, 941\u201354, (1993).","journal-title":"IEEE Trans. N.N."},{"doi-asserted-by":"crossref","unstructured":"Brodal, G. S., Tr\u00e4ff, J. L. & Zaroliagis, C. D. A parallel priority data structure with applications. Proc. 11th Int. Par. Processing Symp., 689\u201393, (1997).","key":"44_CR2","DOI":"10.1109\/IPPS.1997.580979"},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0893-6080(94)90032-9","volume":"7","author":"S. Cavalieri","year":"1994","unstructured":"Cavalieri S., Di Stefano A. and Mirabella O., Optimal Path Determination in a Graph by Hopfield Neural Network. Neural Networks 7-2, 397\u2013404, (1994).","journal-title":"Neural Networks"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"Dijkstra, E. W. A note on two problems in connection with graphs. Numerische Mathematik, 1, 269\u201371, (1959).","journal-title":"Numerische Mathematik"},{"unstructured":"Grimaldi, Ralph. Matem\u00e1tica Discreta y Combinatoria. Cap 13.1, (1999).","key":"44_CR5"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02254849","volume":"29","author":"P. Mateti","year":"1982","unstructured":"Mateti, P. & Deo N., Parallel Alg. for Single Source SPP. Computing 29, 31\u201349, (1982).","journal-title":"Computing"},{"unstructured":"M\u00e9rida Casermeiro, E. Red Neuronal Recurrente Multivaluada para el rec. patrones y la optimiz. comb. Ph.D. dissertation. University of M\u00e1laga, Spain, (in Spanish), 2000.","key":"44_CR7"},{"doi-asserted-by":"crossref","unstructured":"M\u00e9rida Casermeiro, E., Gal\u00e1n Mar\u00edn, G. & Mu\u00f1oz P\u00e9rez, J. An efficient multiv. Hopfield N. for the T.S.P. Neural Procc. Letters. 14, 203\u201316, (2001).","key":"44_CR8","DOI":"10.1023\/A:1012751230791"},{"key":"44_CR9","series-title":"Lect Notes Comput Sci","first-page":"522","volume-title":"A recurrent multivalued N.N. for N-Queens Problem","author":"E. M\u00e9rida Casermeiro","year":"2001","unstructured":"M\u00e9rida Casermeiro, E., Mu\u00f1oz P\u00e9rez, J. and Ben\u00edtez Rochel, R. A recurrent multivalued N.N. for N-Queens Problem. LNCS 2084, 522\u201329, (2001)."},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/BF02276912","volume":"40","author":"T. Mohr","year":"1988","unstructured":"Mohr T. and Pasche C, A Parallel Shortest Path Alg., Computing 40 767\u201386, (1988).","journal-title":"Computing"},{"unstructured":"Paige, R. and Kruskal, C. Parallel algorithms for shortest paths problems. Proceedings International Conf. on Parallel Processing, 14\u201319, (1989).","key":"44_CR11"},{"key":"44_CR12","first-page":"1673","volume":"2","author":"D-C. Park","year":"1998","unstructured":"Park D-C. and Choi S-E. A N.N. based multi-destination routing algorithm for communication network. IEEE Int. Joint Conf. N.N. 2, 1673\u201378, (1998).","journal-title":"IEEE Int. Joint Conf. N.N."},{"doi-asserted-by":"crossref","unstructured":"Rauch H.E. and Winarske T. Neural Networks for routing communication traffic. IEEE Cont. Syst. Mag, 26\u201330, (1988).","key":"44_CR13","DOI":"10.1109\/37.1870"},{"key":"44_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0925-2312(96)00037-9","volume":"14","author":"G. Serpen","year":"1997","unstructured":"Serpen, Gursen and Parvin, Azadeh. On the performance of Hopfield network for graph search problem. Neurocomputing 14, 365\u201381, (1997).","journal-title":"Neurocomputing"},{"doi-asserted-by":"crossref","unstructured":"Zhang L. and Thomopoulos S. C. A., N.N. implem. of the shortest path alg. for traffic routing in comm. networks. Proc. Int. Conf. N.N. II, 591, (1989).","key":"44_CR15","DOI":"10.1109\/IJCNN.1989.118375"}],"container-title":["Lecture Notes in Computer Science","Computational Methods in Neural Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44868-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T01:04:05Z","timestamp":1737594245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44868-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402107","9783540448686"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44868-3_44","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}