{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:33:15Z","timestamp":1772908395527,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T00:00:00Z","timestamp":1630800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T00:00:00Z","timestamp":1630800000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T00:00:00Z","timestamp":1630800000000},"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":[[2021,9,5]]},"DOI":"10.1109\/iscc53001.2021.9631469","type":"proceedings-article","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T15:46:50Z","timestamp":1639583210000},"page":"1-8","source":"Crossref","is-referenced-by-count":11,"title":["An Effective Data Structure for Contact Sequence Temporal Graphs"],"prefix":"10.1109","author":[{"given":"Sanaz","family":"Gheibi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tania","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Ranka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sartaj","family":"Sahni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/090776573"},{"key":"ref11","first-page":"347","article-title":"An all pairs shortest path algorithm for dynamic graphs","volume":"15","author":"alshammari","year":"2020","journal-title":"Comput Sci"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.198"},{"key":"ref13","first-page":"77","article-title":"On mining distances in large-scale dynamic graphs","author":"cicerone","year":"2018","journal-title":"ICTC"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.12.013"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063834"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062083"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039492"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0219-2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.05.066"},{"key":"ref28","year":"0","journal-title":"Bureau of Transportation Statistics"},{"key":"ref4","first-page":"10","article-title":"Evolving graphs and least cost journeys in dynamic networks","author":"bui-xuan","year":"2003","journal-title":"WiOpt'03 Modeling and Optimization in Mobile Ad Hoc and Wireless Networks"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2008.00649.x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2019.07.006"},{"key":"ref29","year":"0","journal-title":"The konect project"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2594065"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882933"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-019-00670-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/0471224561.ch21"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45841-7_2"},{"key":"ref9","first-page":"494","article-title":"Efficient computation of optimal temporal walks under waiting-time constraints","author":"himmel","year":"2019","journal-title":"International Conference on Complex Networks and Their Applications"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2017.17"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2020.106086"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.04.021"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2017.58"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622042"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1590\/0101-7438.2017.037.03.0487"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2018.8687194"}],"event":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","location":"Athens, Greece","start":{"date-parts":[[2021,9,5]]},"end":{"date-parts":[[2021,9,8]]}},"container-title":["2021 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9631377\/9631248\/09631469.pdf?arnumber=9631469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T12:54:22Z","timestamp":1652187262000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9631469\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,5]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/iscc53001.2021.9631469","relation":{},"subject":[],"published":{"date-parts":[[2021,9,5]]}}}