{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:56Z","timestamp":1775912996394,"version":"3.50.1"},"reference-count":64,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100007763","name":"Engineering Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007763","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/icde55515.2023.00198","type":"proceedings-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T17:51:13Z","timestamp":1690393873000},"page":"2579-2592","source":"Crossref","is-referenced-by-count":18,"title":["Towards Efficient Shortest Path Counting on Billion-Scale Graphs"],"prefix":"10.1109","author":[{"given":"Yiqi","family":"Wang","sequence":"first","affiliation":[{"name":"Nanjing University of Science and Technology,Nanjing,China"}]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[{"name":"Nanjing University of Science and Technology,Nanjing,China"}]},{"given":"Zi","family":"Chen","sequence":"additional","affiliation":[{"name":"East China Normal University"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"The University of New South Wales,Sydney,Australia"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"Shanghai Jiaotong University,Shanghai,China"}]},{"given":"Qing","family":"Liu","sequence":"additional","affiliation":[{"name":"CSIRO,Data61,Hobart,Australia"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0608024"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.57"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-014-0220-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2004-00111-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"ref12","first-page":"56:1","article-title":"On counting oracles for path problems","volume-title":"Proceedings of ISAAC","volume":"123","author":"Bez\u00e1kov\u00e1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951437"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v12i1.18548"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3186586"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0274-x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3459245"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380119"},{"key":"ref19","volume-title":"Introduction to algorithms","author":"Cormen","year":"2022"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref21","first-page":"538","volume-title":"The parameterized complexity of counting problems","author":"Flum"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"ref23","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","volume-title":"Proceedings of SODA","author":"Goldberg"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13544"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489499"},{"issue":"3","key":"ref26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(94)00085-9","article-title":"Counting trees in a graph is# p-complete","volume":"51","author":"Jerrum","year":"1994","journal-title":"Information processing letters"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732993"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(05)80078-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1180875.1180901"},{"key":"ref31","volume-title":"SNAP Datasets: Stanford large network dataset collection","author":"Leskovec"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319877"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389748"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164141"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313522"},{"key":"ref36","first-page":"682","article-title":"Approximately counting up to four","volume-title":"Proceedings of STOC","author":"Luby"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732978"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-014-9571-7"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196913"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377371"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17551-0_8"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-018-2480-z"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3433652"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0423-0"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00142"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"ref48","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","volume-title":"Proceedings of AISTATS","volume":"5","author":"Shervashidze"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321520"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/s0269-8579(86)80034-x"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140438"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0338-6"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CSB.2005.9"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3080293"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93037-4_17"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0408-z"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157802"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2783933"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449810"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551820"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.14778\/3494124.3494148"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389737"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465277"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487665"}],"event":{"name":"2023 IEEE 39th International Conference on Data Engineering (ICDE)","location":"Anaheim, CA, USA","start":{"date-parts":[[2023,4,3]]},"end":{"date-parts":[[2023,4,7]]}},"container-title":["2023 IEEE 39th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10184508\/10184509\/10184857.pdf?arnumber=10184857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T02:24:56Z","timestamp":1705026296000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10184857\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":64,"URL":"https:\/\/doi.org\/10.1109\/icde55515.2023.00198","relation":{},"subject":[],"published":{"date-parts":[[2023,4]]}}}