{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:01:48Z","timestamp":1743004908426,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319689524"},{"type":"electronic","value":"9783319689531"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68953-1_5","type":"book-chapter","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T08:11:17Z","timestamp":1507795877000},"page":"41-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths"],"prefix":"10.1007","author":[{"given":"Mohsen","family":"Safari","sequence":"first","affiliation":[]},{"given":"Ali","family":"Ebnenasir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,9]]},"reference":[{"key":"5_CR1","unstructured":"9th DIMACS implementation challenge-shortest paths. http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml"},{"key":"5_CR2","unstructured":"Stanford Network Analysis Project. http:\/\/snap.stanford.edu\/"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 87\u201390 (1958)","DOI":"10.1090\/qam\/102435"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Burtscher, M., Nasre, R., Pingali, K.: A quantitative study of irregular programs on GPUs. In: IEEE International Symposium on Workload Characterization (IISWC), pp. 141\u2013151. IEEE (2012)","DOI":"10.1109\/IISWC.2012.6402918"},{"issue":"8","key":"5_CR5","doi-asserted-by":"publisher","first-page":"2222","DOI":"10.1109\/TPDS.2015.2485994","volume":"27","author":"F Busato","year":"2016","unstructured":"Busato, F., Bombieri, N.: An efficient implementation of the Bellman-Ford algorithm for Kepler GPU architectures. IEEE Trans. Parallel Distrib. Syst. 27(8), 2222\u20132233 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"08","key":"5_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.4236\/jcc.2015.38005","volume":"3","author":"A Chaibou","year":"2015","unstructured":"Chaibou, A., Sie, O.: Improving global performance on GPU for algorithms with main loop containing a reduction operation: case of Dijkstra\u2019s algorithm. J. Comput. Commun. 3(08), 41 (2015)","journal-title":"J. Comput. Commun."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/BFb0055823","volume-title":"Mathematical Foundations of Computer Science 1998","author":"A Crauser","year":"1998","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.) MFCS 1998. LNCS, vol. 1450, pp. 722\u2013731. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055823"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Davidson, A., Baxter, S., Garland, M., Owens, J.D.: Work-efficient parallel GPU methods for single-source shortest paths. In: Proceedings of the IEEE 28th International Parallel and Distributed Processing Symposium (IPDPS 2014), pp. 349\u2013359 (2014)","DOI":"10.1109\/IPDPS.2014.45"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","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(1), 269\u2013271 (1959)","journal-title":"Numerische mathematik"},{"key":"5_CR10","volume-title":"CUDA Application Design and Development","author":"R Farber","year":"2011","unstructured":"Farber, R.: CUDA Application Design and Development. Elsevier, Oxford (2011)"},{"key":"5_CR11","unstructured":"Ford Jr., L.R.: Network flow theory. Technical report, DTIC Document (1956)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-77220-0_21","volume-title":"High Performance Computing \u2013 HiPC 2007","author":"P Harish","year":"2007","unstructured":"Harish, P., Narayanan, P.J.: Accelerating large graph algorithms on the GPU using CUDA. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol. 4873, pp. 197\u2013208. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77220-0_21"},{"key":"5_CR13","unstructured":"Harish, P., Vineet, V., Narayanan, P.: Large graph algorithms for massively multithreaded architectures. International Institute of Information Technology Hyderabad, Technical report IIIT\/TR\/2009\/74 (2009)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Khorasani, F., Vora, K., Gupta, R., Bhuyan, L.N.: CuSha: vertex-centric graph processing on GPUs. In: Proceedings of the 23rd International Symposium on High-Performance Parallel and Distributed Computing, pp. 239\u2013252 (2014)","DOI":"10.1145\/2600212.2600227"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, S., Misra, A., Tomar, R.S.: A modified parallel approach to single source shortest path problem for massively dense graphs using CUDA. In: 2nd International Conference on Computer and Communication Technology (ICCCT), pp. 635\u2013639. IEEE (2011)","DOI":"10.1109\/ICCCT.2011.6075214"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Li, D., Becchi, M.: Deploying graph algorithms on GPUs: an adaptive solution. In: IEEE 27th International Symposium on Parallel & Distributed Processing (IPDPS), pp. 1013\u20131024. IEEE (2013)","DOI":"10.1109\/IPDPS.2013.101"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1007\/978-3-642-01970-8_91","volume-title":"Computational Science \u2013 ICCS 2009","author":"PJ Mart\u00edn","year":"2009","unstructured":"Mart\u00edn, P.J., Torres, R., Gavilanes, A.: CUDA solutions for the SSSP problem. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2009. LNCS, vol. 5544, pp. 904\u2013913. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01970-8_91"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/3-540-68530-8_33","volume-title":"Algorithms \u2014 ESA\u201998","author":"U Meyer","year":"1998","unstructured":"Meyer, U., Sanders, P.: $$\\varDelta $$-stepping : a parallel single source shortest path algorithm. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 393\u2013404. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-68530-8_33"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Nasre, R., Burtscher, M., Pingali, K.: Atomic-free irregular computations on GPUs. In: Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units, pp. 96\u2013107. ACM (2013)","DOI":"10.1145\/2458523.2458533"},{"issue":"5","key":"5_CR20","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1007\/s10766-015-0351-z","volume":"43","author":"H Ortega-Arranz","year":"2015","unstructured":"Ortega-Arranz, H., Torres, Y., Gonzalez-Escribano, A., Llanos, D.R.: Comprehensive evaluation of a new GPU-based approach to the shortest path problem. Int. J. Parallel Program. 43(5), 918\u2013938 (2015)","journal-title":"Int. J. Parallel Program."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Ortega-Arranz, H., Torres, Y., Llanos, D., Gonzalez-Escribano, A.: A new GPU-based approach to the shortest path problem. In: High Performance Computing and Simulation (HPCS), pp. 505\u2013511. IEEE (2013)","DOI":"10.1109\/HPCSim.2013.6641461"},{"key":"5_CR22","unstructured":"Sherwani, N.A.: Algorithms for VLSI Physical Design Automation. Springer (2012)"},{"issue":"9","key":"5_CR23","first-page":"4610","volume":"2","author":"S Shirinivas","year":"2010","unstructured":"Shirinivas, S., Vetrivel, S., Elango, N.: Applications of graph theory in computer science an overview. Int. J. Eng. Sci. Technol. 2(9), 4610\u20134621 (2010)","journal-title":"Int. J. Eng. Sci. Technol."},{"key":"5_CR24","unstructured":"Siek, J.G., Lee, L.-Q., Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual, Portable Documents. Pearson Education (2001)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Singh, D.P., Khare, N.: Modified Dijkstra\u2019s algorithm for dense graphs on GPU using CUDA. Indian J. Sci. Technol. 9(33) (2016)","DOI":"10.17485\/ijst\/2016\/v9i33\/87795"},{"issue":"4","key":"5_CR26","first-page":"2560","volume":"11","author":"DP Singh","year":"2016","unstructured":"Singh, D.P., Khare, N., Rasool, A.: Efficient parallel implementation of single source shortest path algorithm on GPU using CUDA. Int. J. Appl. Eng. Res. 11(4), 2560\u20132567 (2016)","journal-title":"Int. J. Appl. Eng. Res."},{"issue":"4","key":"5_CR27","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv. (CSUR) 46(4), 45 (2014)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Wang, Y., Davidson, A., Pan, Y., Wu, Y., Riffel, A., Owens, J.D.: Gunrock: a high-performance graph processing library on the GPU. In: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2016), pp. 11:1\u201311:12 (2016)","DOI":"10.1145\/2851141.2851145"},{"issue":"6","key":"5_CR29","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1109\/TPDS.2013.111","volume":"25","author":"J Zhong","year":"2014","unstructured":"Zhong, J., He, B.: Medusa: simplified graph processing on GPUs. IEEE Trans. Parallel Distrib. Syst. 25(6), 1543\u20131552 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Topics in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68953-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T16:14:58Z","timestamp":1634055298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-68953-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319689524","9783319689531"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68953-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"9 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Topics in Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tehran","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iran","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icttcs2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ttcs.ir","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}