{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:16:34Z","timestamp":1740132994913,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"2018 Seed Money Project of Chongqing Liangjiang KAIST International Program"},{"DOI":"10.13039\/501100004867","name":"Chongqing University of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004867","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013223","name":"Chongqing Research Program of Basic Research and Frontier Technology","doi-asserted-by":"publisher","award":["cstc2017jcyjAX0089"],"award-info":[{"award-number":["cstc2017jcyjAX0089"]}],"id":[{"id":"10.13039\/501100013223","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1109\/tkde.2019.2924419","type":"journal-article","created":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T20:17:15Z","timestamp":1561666635000},"page":"85-99","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Distance Sensitivity Oracles for Real-World Graph Data"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0774-3619","authenticated-orcid":false,"given":"Jong-Ryul","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6892-1226","authenticated-orcid":false,"given":"Chin-Wan","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"26","article-title":"Computing point-to-point shortest paths from external memory","author":"goldberg","year":"2005","journal-title":"Proc 7th Workshop Algorithm Eng Experiments 2nd Workshop Analytic Algorithmics Combinatorics"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13073-1_32"},{"key":"ref31","first-page":"156","article-title":"Computing the shortest path: A* search meets graph theory","author":"goldberg","year":"2005","journal-title":"Proc 16th Ann ACM-SIAM Symp Discr Algorithms"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.04.008"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2399306"},{"key":"ref34","article-title":"Analysis of multilevel graph partitioning","author":"karypis","year":"1995","journal-title":"Proc ACM\/IEEE Conf Supercomput"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732963"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063834"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213888"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536346"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568007"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983731"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_5"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1109\/TKDE.2013.176","article-title":"Towards online shortest path computation","volume":"26","author":"zhao","year":"2014","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-007-0023-5"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1126\/science.1137521","article-title":"Fast routing in road networks with transit nodes","volume":"316","author":"bast","year":"2007","journal-title":"Sci"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983712"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536431"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.20"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-642-38527-8_7","article-title":"Transit node routing reconsidered","author":"arz","year":"2013","journal-title":"Proc Int'l Symp Experimental Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.56"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.68"},{"key":"ref7","first-page":"145","article-title":"SIEF: Efficiently answering distance queries for failure prone graphs","author":"qin","year":"2015","journal-title":"Proc Intl Conf Extending Database Technology"},{"key":"ref2","first-page":"34","article-title":"Improved distance sensitivity oracles via random sampling","author":"bernstein","year":"2008","journal-title":"Proc 19th Annu ACM-SIAM Symp Discr Algorithms"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2438645.2438646"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705429847"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-008-9172-y"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.198"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref24","first-page":"568","article-title":"Highway hierarchies hasten exact shortest path queries","author":"sanders","year":"2005","journal-title":"Proc Eur Symp Algorithms"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/978-3-642-20662-7_32","article-title":"Customizable route planning","author":"delling","year":"2011","journal-title":"Proc Int'l Symp Experimental Algorithms"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9285350\/08747491.pdf?arnumber=8747491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:50Z","timestamp":1652194250000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8747491\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":36,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2924419","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}