{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T22:27:45Z","timestamp":1672439265279},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,2,26]],"date-time":"2015-02-26T00:00:00Z","timestamp":1424908800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10766-015-0351-z","type":"journal-article","created":{"date-parts":[[2015,2,25]],"date-time":"2015-02-25T09:10:34Z","timestamp":1424855434000},"page":"918-938","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Comprehensive Evaluation of a New GPU-based Approach to the Shortest Path Problem"],"prefix":"10.1007","volume":"43","author":[{"given":"Hector","family":"Ortega-Arranz","sequence":"first","affiliation":[]},{"given":"Yuri","family":"Torres","sequence":"additional","affiliation":[]},{"given":"Arturo","family":"Gonzalez-Escribano","sequence":"additional","affiliation":[]},{"given":"Diego R.","family":"Llanos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,26]]},"reference":[{"key":"351_CR1","unstructured":"Bast, H., Delling, D., Goldberg, A., Muller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.: Route planning in transportation networks. In: Microsoft Research, Techical Report MSR-TR-2014-4 (2014)"},{"key":"351_CR2","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases, in VLDB\u201903, pp. 802\u2013813. VLDB Endowment, Berlin (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"351_CR3","doi-asserted-by":"crossref","unstructured":"Barrett, C., Jacob, R., Marathe, M.: Formal-language-constrained path problems. SIAM J. Comput. 30, 809\u2013837 (2000)","DOI":"10.1137\/S0097539798337716"},{"key":"351_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"351_CR5","volume-title":"The Boost Graph Library: User Guide and Reference Manual","author":"JG Siek","year":"2002","unstructured":"Siek, J.G., Lee, L.-Q., Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Longman, Boston, MA (2002)"},{"key":"351_CR6","doi-asserted-by":"crossref","unstructured":"Mart\u00edn, P., Torres, R., Gavilanes, A.: CUDA Solutions for the SSSP Problem. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G., Dongarra, J., Sloot, P. (eds.) In Computational Science\u2014ICCS 2009, ser. LNCS. vol. 5544, pp. 904\u2013913. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-01970-8_91"},{"key":"351_CR7","unstructured":"Harish, P., Vineet, V., Narayanan, P.J.: Large graph algorithms for massively multithreaded architectures, Centre for Visual Information Technology, International Institute of IT, Hyderabad, India, Techical Report IIIT\/TR\/2009\/74 (2009)"},{"key":"351_CR8","unstructured":"Kirk, D.B., Hwu, W.W.: Programming Massively Parallel Processors: A Hands-on Approach. Morgan Kaufmann, San Francisco, CA (2010)"},{"key":"351_CR9","doi-asserted-by":"crossref","unstructured":"Crauser, A., Mehlhorn, K., Meyer, U., Sanders, P.: A parallelization of Dijkstra\u2019s shortest path algorithm. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) In Mathematical Foundations of Computer Science 1998, ser. LNCS, vol. 1450, pp. 722\u2013731. Springer, Berlin (1998)","DOI":"10.1007\/BFb0055823"},{"key":"351_CR10","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd ed. Burr Ridge, Il 60521: McGraw-Hill Higher Education (2001)"},{"key":"351_CR11","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596\u2013615 (1987)","journal-title":"J. ACM"},{"issue":"10","key":"351_CR12","first-page":"26","volume":"54","author":"DP Singh","year":"2012","unstructured":"Singh, D.P., Khare, N.: A study of different parallel implementations of single source shortest path algorithms. Int. J. Comput. Appl. 54(10), 26\u201330 (2012)","journal-title":"Int. J. Comput. Appl."},{"key":"351_CR13","unstructured":"Papaefthymiou, M., Rodrigue, J.: Implementing Parallel Shortest-paths Algorithms, ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. vol. 30, pp. 59\u201368. American Mathematical Society, Providence (1994)"},{"key":"351_CR14","doi-asserted-by":"crossref","unstructured":"Meyer, U., Sanders, P.: $$\\Delta $$ \u0394 -Stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1), 114\u2013152 (2003) [Online]. Available: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0196677403000762","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"351_CR15","doi-asserted-by":"crossref","unstructured":"Davidson, A., Baxter, S., Garland, M., Owens, J.: Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths, in Parallel and Distributed Processing Symposium, 2014 IEEE 28th International, pp. 349\u2013359 (2014)","DOI":"10.1109\/IPDPS.2014.45"},{"key":"351_CR16","unstructured":"Harris, M.: Optimizing Parallel Reduction in CUDA, developer.download.nvidia.com\/assets\/cuda\/files\/reduction.pdf, nVidia (2008)"},{"key":"351_CR17","doi-asserted-by":"crossref","unstructured":"Ortega, H., Torres, Y., Gonzalez-Escribano, A., Llanos, D.R.: Optimizing an APSP implementation for NVIDIA GPUs using Kernel characterization criteria. J. Supercomput. 70(2), 786\u2013798 (2014)","DOI":"10.1007\/s11227-014-1212-z"},{"key":"351_CR18","doi-asserted-by":"crossref","unstructured":"Nobari, S., Lu, X., Karras, P., Bressan, S.: Fast random graph generation, In: Proceedings of the 14th International Conference on Extending Database Technology, ser. EDBT\/ICDT \u201911. pp. 331\u2013342. ACM, New York, NY (2011)","DOI":"10.1145\/1951365.1951406"},{"key":"351_CR19","unstructured":"DIMACS implementation challenge, (2012). [Online]. Available: http:\/\/www.cise.ufl.edu\/research\/sparse\/dimacs10"},{"key":"351_CR20","unstructured":"Gleich, D.F.: Graph of flickr photo-sharing social network crawled in may 2006, (2012). [Online]. Available: https:\/\/purr.purdue.edu\/publications\/1002"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-015-0351-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-015-0351-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-015-0351-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T07:14:41Z","timestamp":1566371681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-015-0351-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,26]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["351"],"URL":"https:\/\/doi.org\/10.1007\/s10766-015-0351-z","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,26]]}}}