{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:55:01Z","timestamp":1725472501004},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540680673"},{"type":"electronic","value":"9783540680703"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11946441_40","type":"book-chapter","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T10:52:47Z","timestamp":1163847167000},"page":"406-417","source":"Crossref","is-referenced-by-count":5,"title":["On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer"],"prefix":"10.1007","author":[{"given":"Gabriele","family":"Di Stefano","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Petricola","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/S0168-9002(97)00040-5","volume":"A 389","author":"F. Aglietti","year":"1997","unstructured":"Aglietti, F., et al.: An overview of the APEmille parallel computer. Nucl. Inst. And Methods in Phys.\u00a0A 389, 56\u201358 (1997)","journal-title":"Nucl. Inst. And Methods in Phys."},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/3-540-61422-2_150","volume-title":"Algorithm Theory - SWAT \u201996","author":"G. Brodal","year":"1996","unstructured":"Brodal, G.: Priority queues on parallel machines. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol.\u00a01097, pp. 416\u2013427. Springer, Heidelberg (1996)"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1006\/jpdc.1998.1425","volume":"49","author":"G. Brodal","year":"1998","unstructured":"Brodal, G., Tr\u00e4ff, J., Zaroliagis, C.: A Parallel Priority Queue with Constant Time Operations. Journal of Parallel and Distributed Computing\u00a049, 4\u201321 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"40_CR5","unstructured":"Cabasino, S., D\u2019Autilia, R., Paolucci, P.S., Todesco, G.M.: The TAO language (1995), http:\/\/www-zeuthen.desy.de\/ape\/html\/APEmille\/Documentation\/"},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-58325-4_191","volume-title":"Algorithms and Computation","author":"D.Z. Chen","year":"1994","unstructured":"Chen, D.Z., Hu, X.: Fast and efficient operations on parallel priority queues. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 279\u2013287. Springer, Heidelberg (1994)"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Chen, C.C., Quimpo, N.F.: On strongly Hamiltonian abelian group graphs. Lecture Notes in Mathematics, vol.\u00a0884, pp. 23\u201334 (1981)","DOI":"10.1007\/BFb0091805"},{"key":"40_CR8","first-page":"35","volume":"27","author":"S.J. Curran","year":"1985","unstructured":"Curran, S.J., Witte, D.: Hamilton paths in Cartesian products of directed cycles. Ann. Discrete Mathematics\u00a027, 35\u201374 (1985)","journal-title":"Ann. Discrete Mathematics"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/71.506694","volume":"7","author":"S.K. Das","year":"1996","unstructured":"Das, S.K., Pinotti, M.C., Sarkar, F.: Optimal and load balanced mapping of parallel priority queues in hypercubes. Trans. Par. Dist. Syst.\u00a07, 555\u2013564 (1996) [Corr. 896]","journal-title":"Trans. Par. Dist. Syst."},{"key":"40_CR10","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 connexion with graphs. Numer. Math.\u00a01, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Di Stefano, G., Petricola, A., Zaroliagis, C.: On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer. Tech. Rep. Univ. of L\u2019Aquila (2006)","DOI":"10.1007\/11946441_40"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Francia, M., Panizzi, E., Petricola, A., Visconti, G.: Parallel Simulation of Orography Influence on Large-Scale Atmosphere Motion on APEmille. In: ACM Computing Frontiers 2004, pp. 320\u2013325 (2004)","DOI":"10.1145\/977091.977137"},{"issue":"3","key":"40_CR13","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci Heaps and their uses in Improved Network Optimization Algorithm. Journal of ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"Journal of ACM"},{"key":"40_CR14","volume-title":"An Introduction to Parallel Algorithms","author":"J. J\u00e1j\u00e1","year":"1992","unstructured":"J\u00e1j\u00e1, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)"},{"key":"40_CR15","first-page":"869","volume":"A, C17","author":"R.M. Karp","year":"1990","unstructured":"Karp, R.M., Ramachandran, V.: Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science\u00a0A, C17, 869\u2013942 (1990)","journal-title":"Handbook of Theoretical Computer Science"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Leontiev, V.K.: Hamiltonian cycles in torical lattices. In: DMTCS Conference, AE, pp. 397\u2013400 (2005)","DOI":"10.46298\/dmtcs.3448"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/3-540-45492-6_56","volume-title":"HPCN 2000","author":"E. Panizzi","year":"2000","unstructured":"Panizzi, E., Sacco, G.: The APEmille project. In: HPCN 2000. LNCS, pp. 539\u2013542. Springer, Heidelberg (2000)"},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1017\/S030500410002394X","volume":"44","author":"R.A. Rankin","year":"1948","unstructured":"Rankin, R.A.: A campanological problem in group theory. Proc. Camb. Phil. Soc.\u00a044, 17\u201325 (1948)","journal-title":"Proc. Camb. Phil. Soc."},{"key":"40_CR19","volume-title":"High Performance Computer Architecture","author":"H.S. Stone","year":"1990","unstructured":"Stone, H.S.: High Performance Computer Architecture. Addison-Wesley, Reading (1990)"},{"key":"40_CR20","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/jgt.3190020206","volume":"2","author":"W. Trotter","year":"1978","unstructured":"Trotter, W., Erd\u00f6s, P.: When the Cartesian product of directed cycles is Hamiltonian. J. Graph Theory\u00a02, 137\u2013142 (1978)","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11946441_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T19:10:40Z","timestamp":1683659440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11946441_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540680673","9783540680703"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11946441_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}