{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:15:44Z","timestamp":1730200544697,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"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":[[2019,12]]},"DOI":"10.1109\/bigdata47090.2019.9005704","type":"proceedings-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T01:05:34Z","timestamp":1582592734000},"page":"227-232","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms on Compressed Time-Evolving Graphs"],"prefix":"10.1109","author":[{"given":"Michael","family":"Nelson","sequence":"first","affiliation":[]},{"given":"Sridhar","family":"Radhakrishnan","sequence":"additional","affiliation":[]},{"given":"Chandra N.","family":"Sekharan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025101"},{"key":"ref11","article-title":"A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks","author":"ferreira","year":"2002","journal-title":"Research Report RR-4403 INRIA"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"ref14","article-title":"Temporal graph traversals: Definitions, algorithms, and applications","author":"huang","year":"2014","journal-title":"arXiv preprint arXiv 1401 1919"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99944"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1883"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-014-7140-3"},{"key":"ref18","article-title":"Dynamic shortest path and transitive closure algorithms: A survey","author":"martin","year":"2017","journal-title":"arXiv preprint arXiv 1709 04864"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(71)90006-8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.08.003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.023"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2015.02.002"},{"key":"ref5","article-title":"Computing shortest, fastest, and foremost journeys in dynamic networks","author":"bui-xuan","year":"2002","journal-title":"Technical Report RR-4589 INRIA"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2012.668546"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0908-6"},{"key":"ref2","article-title":"Survey and taxonomy of lossless graph compression and space-efficient graph representations","author":"besta","year":"2018","journal-title":"arXiv preprint arXiv 1806 01799"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0201008"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767832"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36461-7_2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732945"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/S0019-9958(73)90228-3","article-title":"A fast expected time algorithm for boolean matrix multiplication and transitive closure","volume":"22","author":"patrick","year":"1973","journal-title":"Information and Control"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_89"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103001728"}],"event":{"name":"2019 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2019,12,9]]},"location":"Los Angeles, CA, USA","end":{"date-parts":[[2019,12,12]]}},"container-title":["2019 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8986695\/9005444\/09005704.pdf?arnumber=9005704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:48:26Z","timestamp":1658080106000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9005704\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/bigdata47090.2019.9005704","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}