{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:53:00Z","timestamp":1773226380503,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T00:00:00Z","timestamp":1470009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2016,8,1]]},"DOI":"10.1109\/tpds.2015.2485994","type":"journal-article","created":{"date-parts":[[2015,10,2]],"date-time":"2015-10-02T14:42:52Z","timestamp":1443796972000},"page":"2222-2233","source":"Crossref","is-referenced-by-count":63,"title":["An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures"],"prefix":"10.1109","volume":"27","author":[{"given":"Federico","family":"Busato","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3256-5885","authenticated-orcid":false,"given":"Nicola","family":"Bombieri","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref38","article-title":"GTgraph: A synthetic graph generator suite","author":"bader","year":"0","journal-title":"9th DIMACS Implementation Challenge"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2330597"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585517"},{"key":"ref30","author":"sedgewick","year":"2011","journal-title":"Algorithms"},{"key":"ref37","article-title":"10th dimacs implementation challenge: Graph partitioning and graph clustering","author":"bader","year":"2011"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941590"},{"key":"ref35","author":"harris","year":"2008","journal-title":"GPU Gems 3 Parallel Prefix Sum (Scan) with CUDA"},{"key":"ref34","year":"2014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2014.6911799"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2014.031914.121830"},{"key":"ref40","author":"leskovec","year":"2014"},{"key":"ref12","first-page":"1","article-title":"Computing paths and cycles in biological interaction graphs","volume":"10","author":"klamt","year":"2014","journal-title":"BMC Bioinformat"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2014.2319233"},{"key":"ref14","year":"0"},{"key":"ref15","year":"0"},{"key":"ref16","year":"0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592101"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.1.65"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77220-0_21"},{"key":"ref4","author":"ford","year":"1956","journal-title":"Network flow theory"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1155\/2005\/128026"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"bellman","year":"1958","journal-title":"Quart Appl Math"},{"key":"ref27","first-page":"135","article-title":"Pregel: A system for Large-scale graph processing","author":"malewicz","year":"0","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/HPCSim.2013.6641461"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01970-8_91"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.202"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1815998"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2012.6402918"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.45"},{"key":"ref1","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.96"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370687"},{"key":"ref42","article-title":"9th DIMACS implementation challenge–shortest paths","author":"demetrescu","year":"0","journal-title":"AMS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90039-X"},{"key":"ref41","author":"siek","year":"2001","journal-title":"The Boost Graph Library User Guide and Reference Manual"},{"key":"ref23","article-title":"Parallel single-source shortest paths","author":"kelley","year":"0"},{"key":"ref26","first-page":"219","article-title":"Single-source shortest paths with the parallel boost graph library","author":"edmonds","year":"0","journal-title":"The Ninth DIMACS Implementation Challenge The Shortest Path Problem"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442530"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/7511818\/07287776.pdf?arnumber=7287776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:45:06Z","timestamp":1641987906000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7287776\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,1]]},"references-count":42,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2015.2485994","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2016,8,1]]}}}