{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:07:31Z","timestamp":1767773251005,"version":"3.37.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673159","61702157"],"award-info":[{"award-number":["61673159","61702157"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Graduate Student Innovation Program of Hebei Province","award":["CXZZSS2017031"],"award-info":[{"award-number":["CXZZSS2017031"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2808407","type":"journal-article","created":{"date-parts":[[2018,2,21]],"date-time":"2018-02-21T14:26:02Z","timestamp":1519223162000},"page":"11707-11715","source":"Crossref","is-referenced-by-count":14,"title":["IBAS: Index Based A-Star"],"prefix":"10.1109","volume":"6","author":[{"given":"Yan","family":"Li","sequence":"first","affiliation":[]},{"given":"Hongyan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Huaizhong","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Jianwei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Yan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5314-3468","authenticated-orcid":false,"given":"Youxi","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.14778\/2947618.2947623"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.02.007"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref32","first-page":"38","article-title":"Nettree for maximum disjoint paths with length constraint in DAG","volume":"36","author":"li","year":"2015","journal-title":"J Commun"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2012.02194"},{"key":"ref30","first-page":"50","article-title":"BiRch: A bidirectional search algorithm for k-step reachability queries","volume":"36","author":"zhou","year":"2015","journal-title":"J Commun"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0381-6"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-016-0288-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12098-5_56"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2750691"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0499-4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0165551512463994"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.physa.2015.01.030","article-title":"Sampling social networks using shortest paths","volume":"424","author":"alireza","year":"2015","journal-title":"Phys A Stat Mech Appl"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015277"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2518692"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.176"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2985473"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920879"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465277"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1110.0448"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0346-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2015.10.018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/0165551512456502"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2631775.2631799"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2725308"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/mutage\/geu078"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.11.010"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2343914"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.06.045"},{"key":"ref42","first-page":"194","article-title":"A K-th shortest path set algorithm for urban traffic network","volume":"14","author":"duan","year":"2014","journal-title":"J Transp Syst Eng Inf Technol"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.12.013"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2507581"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.12.027"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213856"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37453-1_4"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08299426.pdf?arnumber=8299426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:38:39Z","timestamp":1641987519000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8299426\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2808407","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}