{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:35:36Z","timestamp":1725586536321},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,10]]},"DOI":"10.1109\/bigdata50022.2020.9378056","type":"proceedings-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T21:10:21Z","timestamp":1616188221000},"page":"3015-3024","source":"Crossref","is-referenced-by-count":1,"title":["Approximately and Efficiently Estimating Dynamic Point-to-Point Shortest Path"],"prefix":"10.1109","author":[{"given":"Alok","family":"Tripathy","sequence":"first","affiliation":[]},{"given":"Oded","family":"Green","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1155\/2005\/128026"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408680"},{"journal-title":"The MapEquation Software Package","year":"0","author":"edler","key":"ref12"},{"key":"ref13","first-page":"88","article-title":"Point-to-Point Shortest Path with Preprocessing","author":"goldberg","year":"2007","journal-title":"SOFSEM ’07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science"},{"key":"ref14","article-title":"Reach for a*: Efficient point-to-point shortest path algorithms","author":"goldberg","year":"2005","journal-title":"Technical report MSR-TR-2005-132"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761622"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"journal-title":"Metis-unstructured Graph Partitioning and Sparse Matrix Ordering System","year":"1995","author":"karypis","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2013.6785684"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73951-7_47"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783333"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973754.12"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1198513.1198519"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547541"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.78"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/588"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19754-3_11"},{"key":"ref1","article-title":"STINGER: SpatioTemporal Interaction Networks and Graphs (STING) Extensible Representation","author":"bader","year":"2009","journal-title":"Technical report Georgia Institute of Technology"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814580"},{"journal-title":"SNAP Datasets Stanford large network dataset collection","year":"0","author":"leskovec","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187884"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44465-8_49"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0046"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"}],"event":{"name":"2020 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2020,12,10]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2020,12,13]]}},"container-title":["2020 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9377717\/9377728\/09378056.pdf?arnumber=9378056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:57:46Z","timestamp":1656345466000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9378056\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,10]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/bigdata50022.2020.9378056","relation":{},"subject":[],"published":{"date-parts":[[2020,12,10]]}}}