{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T22:21:32Z","timestamp":1755037292952},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"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":[[2023,7,9]]},"DOI":"10.1109\/iscc58397.2023.10218173","type":"proceedings-article","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T17:46:48Z","timestamp":1693244808000},"page":"392-398","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Walks in Contact Sequence Temporal Graphs with No Zero Duration Cycle"],"prefix":"10.1109","author":[{"given":"Anuj","family":"Jain","sequence":"first","affiliation":[{"name":"Adobe Systems Inc.,Lehi,UT,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sartaj","family":"Sahni","sequence":"additional","affiliation":[{"name":"University of Florida,CISE Deptt,Gainesville,FL,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"27","article-title":"Models and techniques for communication in dynamic networks","author":"scheideler","year":"0","journal-title":"STACS 2002"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1086\/386272"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.81.035101"},{"key":"ref14","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":"ref20","doi-asserted-by":"publisher","DOI":"10.3390\/a15100361"},{"journal-title":"Temporal Networks as a Modeling Framework","year":"2021","author":"holme","key":"ref11"},{"journal-title":"The complexity of finding small separators in temporal graphs","year":"2017","author":"zschoche","key":"ref22"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.94.022305"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC53001.2021.9631469"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45841-7_2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-020-00311-0"},{"journal-title":"A temporal neural network architecture for online learning","year":"2020","author":"smith","key":"ref17"},{"journal-title":"Temporal graph networks for deep learning on dynamic graphs","year":"2020","author":"rossi","key":"ref16"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-022-00499-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2594065"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s13174-012-0073-z"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1959045.1959064"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41597-019-0060-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"ref3","first-page":"451","author":"stojmenovi?","year":"2002","journal-title":"Location Updates for Efficient Routing in Ad Hoc Networks"},{"journal-title":"Time-Varying Graphs and Social Network Analysis Temporal Indicators and Metrics","year":"2011","author":"santoro","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24024-4_18"}],"event":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2023,7,9]]},"location":"Gammarth, Tunisia","end":{"date-parts":[[2023,7,12]]}},"container-title":["2023 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10217219\/10217829\/10218173.pdf?arnumber=10218173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T17:50:02Z","timestamp":1695664202000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10218173\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,9]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/iscc58397.2023.10218173","relation":{},"subject":[],"published":{"date-parts":[[2023,7,9]]}}}