{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T08:12:13Z","timestamp":1778227933360,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819203659","type":"print"},{"value":"9789819203666","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-92-0366-6_25","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T07:40:58Z","timestamp":1778226058000},"page":"403-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hop-Constrained s-t Simple Path Enumeration: Towards Reducing Repeated Vertex Checks"],"prefix":"10.1007","author":[{"given":"Tong","family":"Pei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengzhao","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayi","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoyan","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Yue D., Wu X., Wang Y., et al.: A review of data mining-based financial fraud detection research. In: International Conference on Wireless Communications, Networking and Mobile Computing, pp. 5519\u20135522 (2007)","DOI":"10.1109\/WICOM.2007.1352"},{"key":"25_CR2","unstructured":"Jedrzejek C., Bak J., Falkowski M.: Graph mining for detection of a large class of financial crimes. In: International Conference on Conceptual Structures, vol. 46 (2009)"},{"key":"25_CR3","unstructured":"F. A. T. Force: Fatf report: Money laundering and terrorist financing vulnerabilities of legal professionals. In: FATF (2013)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Zhang J., Yang S., Ouyang D., et al.: Hop-constrained s-t simple path enumeration on large dynamic graphs. In: ICDE, pp. 762-775 (2023)","DOI":"10.1109\/ICDE55515.2023.00064"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Li X., Liu S., Li Z., et al.: FlowScope: spotting money laundering based on graphs. In: AAAI, pp. 4731\u20134738 (2020)","DOI":"10.1609\/aaai.v34i04.5906"},{"issue":"4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/0026-2714(80)90584-3","volume":"20","author":"RB Misra","year":"1980","unstructured":"Misra, R.B., Misra, K.B.: Enumeration of all simple paths in a communication network. Microelectron. Reliab. 20(4), 419\u2013426 (1980)","journal-title":"Microelectron. Reliab."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Vass B., Tapolcai J., Hay D., et al.: How to model and enumerate geographically correlated failure events in communication networks. Guide to Disaster-Resilient Communication Networks, pp. 87\u2013115 (2020)","DOI":"10.1007\/978-3-030-44685-7_4"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Fontugne R., Pelsser C., Aben E., et al.: Pinpointing delay and forwarding anomalies using large-scale traceroute measurements. In: IMC, pp. 15\u201328 (2017)","DOI":"10.1145\/3131365.3131384"},{"key":"25_CR9","first-page":"59323","volume":"36","author":"Z Zhu","year":"2023","unstructured":"Zhu, Z., Yuan, X., Galkin, M., et al.: A*Net: a scalable path-based reasoning method for knowledge graphs. Adv. Neural. Inf. Process. Syst. 36, 59323\u201359336 (2023)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Tan X., Wang X., Liu Q., et al.: Paths-over-graph: knowledge graph empowered large language model reasoning. In: WWW, pp. 3505\u20133522 (2025)","DOI":"10.1145\/3696410.3714892"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.knosys.2016.04.015","volume":"104","author":"B Shi","year":"2016","unstructured":"Shi, B., Weninger, T.: Discriminative predicate path mining for fact checking in knowledge graphs. Knowl.-Based Syst. 104, 123\u2013133 (2016)","journal-title":"Knowl.-Based Syst."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Zeng Y., Fang Y., Ma C., et al.: Efficient distributed hop-constrained path enumeration on large-scale graphs. In: SIGMOD, pp. 1\u201325 (2024)","DOI":"10.1145\/3639277"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Grossi R., Marino A., Versari L.: Efficient algorithms for listing k disjoint st-Paths in graphs. In: LATIN, pp. 544\u2013557 (2018)","DOI":"10.1007\/978-3-319-77404-6_40"},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.14778\/3372716.3372720","volume":"13","author":"Y Peng","year":"2019","unstructured":"Peng, Y., Zhang, Y., Lin, X., et al.: Hop-constrained s-t simple path enumeration: towards bridging theory and practice. Proc. VLDB Endow. 13(4), 463\u2013476 (2019)","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"25_CR15","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s00778-021-00674-5","volume":"30","author":"Y Peng","year":"2021","unstructured":"Peng, Y., Lin, X., Zhang, Y., et al.: Efficient hop-constrained s-t simple path enumeration. VLDB J. 30(5), 799\u2013823 (2021)","journal-title":"VLDB J."},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Rizzi R., Sacomoto G., Sagot M F.: Efficiently listing bounded length st-paths. In: International Workshop on Combinatorial Algorithms, pp. 318\u2013329 (2014)","DOI":"10.1007\/978-3-319-19315-1_28"},{"issue":"12","key":"25_CR17","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.14778\/3229863.3229874","volume":"11","author":"X Qiu","year":"2018","unstructured":"Qiu, X., Cen, W., Qian, Z., et al.: Real-time constrained cycle detection in large dynamic graphs. Proc. VLDB Endow. 11(12), 1876\u20131888 (2018)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"169","DOI":"10.14778\/3489496.3489499","volume":"15","author":"K Hao","year":"2021","unstructured":"Hao, K., Yuan, L., Zhang, W.: Distributed hop-constrained s-t simple path enumeration at billion scale. Proc. VLDB Endow. 15(2), 169\u2013182 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Zhang J., Yang S., Ouyang D., et al.: Hop-constrained s-t simple path enumeration on large dynamic graphs. In: ICDE, pp. 762\u2013775 (2023)","DOI":"10.1109\/ICDE55515.2023.00064"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Sun S., Chen Y., He B., et al.: PathEnum: towards real-time hop-constrained s-t path enumeration. In: SIGMOD, pp. 1758\u20131770 (2021)","DOI":"10.1145\/3448016.3457290"},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0898-1221(81)90008-0","volume":"7","author":"M Sharir","year":"1981","unstructured":"Sharir, M.: A strong-connectivity algorithm and its applications in data flow analysis. Comput. Math. Appl. 7(1), 67\u201372 (1981)","journal-title":"Comput. Math. Appl."},{"key":"25_CR22","unstructured":"Johnson D. S., Garey M. R.: Computers and intractability: A guide to the theory of NP-completeness. WH Freeman (1979)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-0366-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T07:41:07Z","timestamp":1778226067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0366-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819203659","9789819203666"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0366-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}