{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:13:30Z","timestamp":1781086410849,"version":"3.54.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23A20496"],"award-info":[{"award-number":["U23A20496"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Science and Technology Innovation Action Plan","award":["1511100401"],"award-info":[{"award-number":["1511100401"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tkde.2025.3532318","type":"journal-article","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T18:48:57Z","timestamp":1737658137000},"page":"2584-2599","source":"Crossref","is-referenced-by-count":3,"title":["Generating kk-Hop-Constrained ss-tt Path Graphs"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7096-5328","authenticated-orcid":false,"given":"Yuzheng","family":"Cai","sequence":"first","affiliation":[{"name":"School of Data Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siyuan","family":"Liu","sequence":"additional","affiliation":[{"name":"Heinz College, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1200-7368","authenticated-orcid":false,"given":"Weiguo","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Data Science, Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-7225","authenticated-orcid":false,"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengbo","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei Technologies, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuecang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei Technologies, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19315-1_28"},{"issue":"4","key":"ref2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.14778\/3372716.3372720","article-title":"Hop-constrained s-t simple path enumeration: Towards bridging theory and practice","volume":"13","author":"Peng","year":"2019","journal-title":"Proc. VLDB Endowment"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00674-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457290"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452826"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405864"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/net.21960"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-73216-5_9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3588915"},{"issue":"3","key":"ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3611642","article-title":"Fast parallel algorithms for enumeration of simple, temporal, and hop-constrained cycles","volume":"10","author":"Blanu\u0161a","year":"2023","journal-title":"ACM Trans. Parallel Comput."},{"key":"ref11","first-page":"247","article-title":"Scalable fine-grained parallel cycle enumeration algorithms","volume-title":"Proc. 34th ACM Symp. Parallelism Algorithms Archit.","author":"Blanusa"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236197"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"},{"issue":"1","key":"ref15","doi-asserted-by":"crossref","first-page":"4:1","DOI":"10.1145\/1868237.1868241","article-title":"Length-bounded cuts and flows","volume":"7","author":"Baier","year":"2010","journal-title":"ACM Trans. Algorithms"},{"key":"ref16","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Rossi"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","article-title":"The directed subgraph homeomorphism problem","volume":"10","author":"Fortune","year":"1980","journal-title":"Theor. Comput. Sci."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.04.018"},{"key":"ref19","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","volume-title":"Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Goldberg"},{"key":"ref20","first-page":"2","article-title":"Combining speed-up techniques for shortest-path computations","volume":"10","author":"Holzer","year":"2005","journal-title":"ACM J. Exp. Algorithms"},{"key":"ref21","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"ref22","article-title":"Engineering distance queries on highly evolving networks","author":"Ikuta","year":"2016"},{"key":"ref23","volume-title":"Optimal Multi-Way Number Partitioning","author":"Schreiber","year":"2014"},{"key":"ref24","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1997"},{"key":"ref25","article-title":"SNAP datasets: Stanford large network dataset collection","author":"Leskovec","year":"2014"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3390\/app13063470"},{"key":"ref28","first-page":"71","article-title":"ESTI: Efficient k-hop reachability querying over large general directed graphs","volume-title":"Proc. Int. Conf. Database Syst. Adv. Appl.","author":"Cai"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"172110","DOI":"10.1109\/ACCESS.2019.2956557","article-title":"HT: A novel labeling scheme for k-hop reachability queries on DAGs","volume":"7","author":"Du","year":"2019","journal-title":"IEEE Access"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2631160"},{"key":"ref31","first-page":"1601","article-title":"Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths","volume-title":"Proc. ACM Int. Conf. Inf. Knowl. Manage.","author":"Yano"},{"key":"ref32","first-page":"193","article-title":"Tf-label: A topological-folding labeling scheme for reachability querying in a large graph","volume-title":"Proc. ACM SIGMOD Int. Conf. Manage. Data","author":"Cheng"},{"issue":"1","key":"ref33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00778-017-0468-3","article-title":"Reachability querying: An independent permutation labeling approach","volume":"27","author":"Wei","year":"2018","journal-title":"VLDB J."},{"issue":"4","key":"ref34","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s00778-011-0256-4","article-title":"GRAIL: A scalable index for reachability queries in very large graphs","volume":"21","author":"Yildirim","year":"2012","journal-title":"VLDB J."},{"key":"ref35","first-page":"511","article-title":"Reachability queries in very large graphs: A fast refined online search approach","volume-title":"Proc. 17th Int. Conf. Extending Database Technol.","author":"Veloso"},{"issue":"2","key":"ref36","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s00778-018-0495-8","article-title":"Accelerating reachability query processing based on DAG reduction","volume":"27","author":"Zhou","year":"2018","journal-title":"VLDB J."},{"issue":"11","key":"ref37","doi-asserted-by":"crossref","first-page":"1292","DOI":"10.14778\/2350229.2350247","article-title":"K-reach: Who is in your small world","volume":"5","author":"Cheng","year":"2012","journal-title":"Proc. VLDB Endowment"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.inffus.2017.02.009","article-title":"BFSI-B: An improved k-hop graph reachability queries for cyber-physical systems","volume":"38","author":"Xie","year":"2017","journal-title":"Inf. Fusion"},{"issue":"2","key":"ref39","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s00778-013-0346-6","article-title":"Efficient processing of k-hop reachability queries","volume":"23","author":"Cheng","year":"2014","journal-title":"VLDB J."},{"key":"ref40","first-page":"290","article-title":"Fast routing in very large public transportation networks using transfer patterns","volume-title":"Proc. 18th Annu. Eur. Conf. Algorithms","author":"Bast"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1007\/978-1-4939-2864-4_728","article-title":"Enumeration of paths, cycles, and spanning trees","volume-title":"Encyclopedia of Algorithms","author":"Grossi","year":"2016"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICInfA.2015.7279596"},{"key":"ref43","first-page":"1884","article-title":"Optimal listing of cycles and st-paths in undirected graphs","volume-title":"Proc. 24th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Birmel\u00e9"},{"key":"ref44","first-page":"544","article-title":"Efficient algorithms for listing k disjoint st-paths in graphs","volume-title":"Proc. Latin Amer. Symp. Theor. Inform.","author":"Grossi"},{"issue":"1","key":"ref45","first-page":"1","article-title":"Efficient distributed hop-constrained path enumeration on large-scale graphs","volume":"2","author":"Zeng","year":"2024","journal-title":"Proc. ACM Manage. Data"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489499"},{"issue":"9","key":"ref47","doi-asserted-by":"crossref","first-page":"1582","DOI":"10.14778\/3397230.3397250","article-title":"Optimal algorithms for ranked enumeration of answers to full conjunctive queries","volume":"13","author":"Tziavelis","year":"2020","journal-title":"Proc. VLDB Endowment"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/s41019-016-0024-y","article-title":"Efficient breadth-first search on massively parallel and distributed-memory machines","volume":"2","author":"Ueno","year":"2017","journal-title":"Data Sci. Eng."},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17450"},{"issue":"4","key":"ref50","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","article-title":"Color-coding","volume":"42","author":"Alon","year":"1995","journal-title":"J. ACM"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10948402\/10851839.pdf?arnumber=10851839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T03:24:20Z","timestamp":1743996260000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10851839\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":50,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3532318","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}