{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T11:20:27Z","timestamp":1775301627941,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/hpec.2018.8547548","type":"proceedings-article","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T19:50:56Z","timestamp":1544212256000},"page":"1-7","source":"Crossref","is-referenced-by-count":3,"title":["A Fast and Efficient Parallel Algorithm for Pruned Landmark Labeling"],"prefix":"10.1109","author":[{"given":"Qing","family":"Dong","sequence":"first","affiliation":[]},{"given":"Kartik","family":"Lakhotia","sequence":"additional","affiliation":[]},{"given":"Hanqing","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Rajgopal","family":"Karman","sequence":"additional","affiliation":[]},{"given":"Viktor","family":"Prasanna","sequence":"additional","affiliation":[]},{"given":"Guna","family":"Seetharaman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref12","author":"ford","year":"1956","journal-title":"Network flow theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref14","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","author":"goldberg","year":"2005","journal-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1126\/science.1137521"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732993"},{"key":"ref4","first-page":"24","article-title":"Hierarchical hub labelings for shortest paths","author":"abraham","year":"2012","journal-title":"European Symposium on Algorithms"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-3-319-55699-4_26","article-title":"Efficient landmark-based candidate generation for knn queries on road networks","author":"abeywickrama","year":"2017","journal-title":"International Conference on Database Systems for Advanced Applications"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_27"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973198.14"},{"key":"ref8","author":"lakhotia","year":"2018","journal-title":"GPOP A cache- and work-efficient framework for graph processing over partitions"},{"key":"ref7","article-title":"Accelerating pagerank using partition-centric processing","author":"lakhotia","year":"2018","journal-title":"2018 USENIX Annual Technical Conference (Usenix ATC)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.105"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1282100.1282167"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164141"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972887.9"},{"key":"ref21","year":"2015","journal-title":"savrus\/hl"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barabsi","year":"1999","journal-title":"Science"},{"key":"ref23","year":"2017","journal-title":"Actor collaborations network dataset – KONECT"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"ref25","author":"demetrescu","year":"2006","journal-title":"Proc 9th DIMACS Implementation Challenge—Shortest Path"}],"event":{"name":"2018 IEEE High Performance Extreme Computing Conference (HPEC)","location":"Waltham, MA","start":{"date-parts":[[2018,9,25]]},"end":{"date-parts":[[2018,9,27]]}},"container-title":["2018 IEEE High Performance extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8534508\/8547513\/08547548.pdf?arnumber=8547548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T10:32:56Z","timestamp":1775298776000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8547548\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/hpec.2018.8547548","relation":{},"subject":[],"published":{"date-parts":[[2018,9]]}}}