{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T04:23:13Z","timestamp":1787718193923,"version":"build-2784847793"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/asonam.2018.8508283","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T23:19:29Z","timestamp":1540509569000},"page":"495-502","source":"Crossref","is-referenced-by-count":0,"title":["Fast Top-k Search with Relaxed Graph Simulation"],"prefix":"10.1109","author":[{"given":"Abdelmalek","family":"Habi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brice","family":"Effantin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu159"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095690"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610513"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213855"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132992"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872762"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447905"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915216"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536263"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274578"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753587"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767858"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920988"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492576"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2528937"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref20","article-title":"Finding top-k shortest paths with diversity","author":"liu","year":"2017","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"ref25","author":"leskovec","year":"2014","journal-title":"SNAP Datasets Stanford large network dataset collection"}],"event":{"name":"2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","location":"Barcelona","start":{"date-parts":[[2018,8,28]]},"end":{"date-parts":[[2018,8,31]]}},"container-title":["2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8488381\/8508239\/08508283.pdf?arnumber=8508283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T17:03:54Z","timestamp":1643216634000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8508283\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/asonam.2018.8508283","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}