{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:48:49Z","timestamp":1755794929297,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T00:00:00Z","timestamp":1752969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3690624.3709310","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T18:44:43Z","timestamp":1743792283000},"page":"1092-1103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Weight-Constrained Simple Path Enumeration in Weighted Graph"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9472-4389","authenticated-orcid":false,"given":"Dian","family":"Ouyang","sequence":"first","affiliation":[{"name":"Guangzhou University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0903-1503","authenticated-orcid":false,"given":"Dong","family":"Wen","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3417-823X","authenticated-orcid":false,"given":"Jianye","family":"Yang","sequence":"additional","affiliation":[{"name":"Guangzhou University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4941-8814","authenticated-orcid":false,"given":"Wentao","family":"Li","sequence":"additional","affiliation":[{"name":"University of Leicester, Leicester, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-7225","authenticated-orcid":false,"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Takuya Akiba Yoichi Iwata and Yuichi Yoshida. 2013. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In SIGMOD. 349--360.","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626567"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_3_2_2_4_1","volume-title":"Bender and Martin Farach-Colton","author":"Michael","year":"2000","unstructured":"Michael A. Bender and Martin Farach-Colton. 2000. The LCA Problem Revisited. In LATIN (Lecture Notes in Computer Science, Vol. 1776). Springer, 88--94."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.134"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Etienne Birmel\u00e9 Rui A. Ferreira Roberto Grossi Andrea Marino Nadia Pisanti Romeo Rizzi and Gustavo Sacomoto. 2013. Optimal Listing of Cycles and st-Paths in Undirected Graphs. In SODA. 1884--1896.","DOI":"10.1137\/1.9781611973105.134"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3198394.3198410"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588915"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/NET.20077"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3451159"},{"key":"e_1_3_2_2_11_1","volume-title":"Overmars","author":"de Berg Mark","year":"2008","unstructured":"Mark de Berg, Otfried Cheong, Marc J. van Kreveld, and Mark H. Overmars. 2008. Computational geometry: algorithms and applications, 3rd Edition. Springer. https:\/\/www.worldcat.org\/oclc\/227584184","edition":"3"},{"key":"e_1_3_2_2_12_1","series-title":"SIAM Journal on computing","volume-title":"Finding the k shortest paths","author":"Eppstein David","year":"1998","unstructured":"David Eppstein. 1998. Finding the k shortest paths. SIAM Journal on computing, Vol. 28, 2 (1998), 652--673."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21552"},{"key":"e_1_3_2_2_14_1","volume-title":"FATF Report: Money Laundering and Terrorist Financing Vulnerabilities of Legal Professionals","author":"Financial Action Task Force","year":"2013","unstructured":"Financial Action Task Force. 2013. FATF Report: Money Laundering and Terrorist Financing Vulnerabilities of Legal Professionals. Paris: FATF (2013)."},{"key":"e_1_3_2_2_15_1","volume-title":"Edward Curry, and Paul Buitelaar.","author":"Freitas Andr\u00e9","year":"2014","unstructured":"Andr\u00e9 Freitas, Jo ao Carlos Pereira da Silva, Edward Curry, and Paul Buitelaar. 2014. A Distributional Semantics Approach for Selective Reasoning on Commonsense Graph Knowledge Bases. In NLDB (Lecture Notes in Computer Science, Vol. 8455). Springer, 21--32."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2630068"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.12.015"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77404-6_40"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77404-6_40"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290682"},{"key":"e_1_3_2_2_21_1","volume-title":"17th International Conference on Conceptual Structures","volume":"46","author":"Jedrzejek Czeslaw","year":"2009","unstructured":"Czeslaw Jedrzejek, J Bak, and M Falkowski. 2009. Graph mining for detection of a large class of financial crimes. In 17th International Conference on Conceptual Structures, Moscow, Russia, Vol. 46."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120406"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01086243"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236197"},{"key":"e_1_3_2_2_26_1","volume-title":"A sidetrack-based algorithm for finding the k shortest simple paths in a directed graph. arXiv preprint arXiv:1601.02867","author":"Kurz Denis","year":"2016","unstructured":"Denis Kurz and Petra Mutzel. 2016. A sidetrack-based algorithm for finding the k shortest simple paths in a directed graph. arXiv preprint arXiv:1601.02867 (2016)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Ulf Leser. 2005. A query language for biological networks. In ECCB\/JBI. 39.","DOI":"10.1093\/bioinformatics\/bti1105"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Xiangfeng Li Shenghua Liu Zifeng Li Xiaotian Han Chuan Shi Bryan Hooi He Huang and Xueqi Cheng. 2020. FlowScope: Spotting Money Laundering Based on Graphs. In AAAI. 4731--4738.","DOI":"10.1609\/aaai.v34i04.5906"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2773492"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Ziyi Liu Lei Li Mengxuan Zhang Wen Hua Pingfu Chao and Xiaofang Zhou. 2021. Efficient Constrained Shortest Path Query Answering with Forest Hop Labeling. In ICDE. 1763--1774.","DOI":"10.1109\/ICDE51399.2021.00155"},{"key":"e_1_3_2_2_31_1","volume-title":"21st International Conference on Database Theory (ICDT","author":"Martens Wim","year":"2018","unstructured":"Wim Martens and Tina Trautner. 2018. Evaluation and enumeration problems for regular path queries. In 21st International Conference on Database Theory (ICDT 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_32_1","first-page":"121","article-title":"A new implementation of Yen's ranking loopless paths algorithm","volume":"1","author":"Martins Ernesto QV","year":"2003","unstructured":"Ernesto QV Martins and Marta MB Pascoal. 2003. A new implementation of Yen's ranking loopless paths algorithm. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, Vol. 1, 2 (2003), 121--133.","journal-title":"Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"volume-title":"Deterministic Skip Lists","author":"Munro J. Ian","key":"e_1_3_2_2_33_1","unstructured":"J. Ian Munro, Thomas Papadakis, and Robert Sedgewick. 1992. Deterministic Skip Lists. In SIAM, Greg N. Frederickson (Ed.). ACM\/SIAM, 367--375. http:\/\/dl.acm.org\/citation.cfm?id=139404.139478"},{"volume-title":"Compiling Graph Substructures into Sentential Decision Diagrams","author":"Nishino Masaaki","key":"e_1_3_2_2_34_1","unstructured":"Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato, and Masaaki Nagata. 2017. Compiling Graph Substructures into Sentential Decision Diagrams. In AAAI. AAAI Press, 1213--1221."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00789-x"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00674-5"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380753"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"e_1_3_2_2_40_1","volume-title":"IWOCA (Lecture Notes in Computer Science","volume":"329","author":"Rizzi Romeo","year":"2014","unstructured":"Romeo Rizzi, Gustavo Sacomoto, and Marie-France Sagot. 2014a. Efficiently Listing Bounded Length st-Paths. In IWOCA (Lecture Notes in Computer Science, Vol. 8986). 318--329."},{"key":"e_1_3_2_2_41_1","volume-title":"International Workshop on Combinatorial Algorithms. Springer, 318--329","author":"Rizzi Romeo","year":"2014","unstructured":"Romeo Rizzi, Gustavo Sacomoto, and Marie-France Sagot. 2014b. Efficiently listing bounded length st-paths. In International Workshop on Combinatorial Algorithms. Springer, 318--329."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958033.1958044"},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Roditty Liam","key":"e_1_3_2_2_43_1","unstructured":"Liam Roditty and Uri Zwick. 2005. Replacement paths and k simple shortest paths in unweighted directed graphs. In International Colloquium on Automata, Languages, and Programming. Springer, 249--260."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2631160"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Shixuan Sun Yuhang Chen Bingsheng He and Bryan Hooi. 2021. PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration. In SIGMOD. ACM 1758--1770.","DOI":"10.1145\/3448016.3457290"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202017"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139774"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.05.040"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015277"},{"volume-title":"Efficiently Answering Span-Reachability Queries in Large Temporal Graphs","author":"Wen Dong","key":"e_1_3_2_2_50_1","unstructured":"Dong Wen, Yilun Huang, Ying Zhang, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2020. Efficiently Answering Span-Reachability Queries in Large Temporal Graphs. In ICDE. IEEE, 1153--1164."},{"key":"e_1_3_2_2_51_1","volume-title":"AMBN (Proceedings of Machine Learning Research","volume":"140","author":"Yasuda Norihito","year":"2017","unstructured":"Norihito Yasuda, Teruji Sugaya, and Shin-ichi Minato. 2017a. Fast Compilation of s-t Paths on a Graph for Counting and Enumeration. In AMBN (Proceedings of Machine Learning Research, Vol. 73). PMLR, 129--140."},{"key":"e_1_3_2_2_52_1","unstructured":"Norihito Yasuda Teruji Sugaya and Shin-Ichi Minato. 2017b. Fast compilation of st paths on a graph for counting and enumeration. In Advanced Methodologies for Bayesian Networks. PMLR 129--140."},{"key":"e_1_3_2_2_53_1","volume-title":"Finding the k shortest loopless paths in a network. management Science","author":"Yen Jin Y","year":"1971","unstructured":"Jin Y Yen. 1971. Finding the k shortest loopless paths in a network. management Science, Vol. 17, 11 (1971), 712--716."},{"volume-title":"Reachability Labeling for Distributed Graphs","author":"Zhang Junhua","key":"e_1_3_2_2_54_1","unstructured":"Junhua Zhang, Wentao Li, Lu Qin, Ying Zhang, Dong Wen, Lizhen Cui, and Xuemin Lin. 2022. Reachability Labeling for Distributed Graphs. In ICDE. IEEE, 686--698."},{"key":"e_1_3_2_2_55_1","volume-title":"2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, 762--775","author":"Zhang Jiujing","year":"2023","unstructured":"Jiujing Zhang, Shiyu Yang, Dian Ouyang, Fan Zhang, Xuemin Lin, and Long Yuan. 2023. Hop-constrained ST simple path enumeration on large dynamic graphs. In 2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, 762--775."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Andy Diwen Zhu Hui Ma Xiaokui Xiao Siqiang Luo Youze Tang and Shuigeng Zhou. 2013. Shortest path and distance queries on road networks: towards bridging theory and practice. In SIGMOD. 857--868.","DOI":"10.1145\/2463676.2465277"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Toronto ON Canada","acronym":"KDD '25"},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709310","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690624.3709310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T15:45:15Z","timestamp":1755359115000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":56,"alternative-id":["10.1145\/3690624.3709310","10.1145\/3690624"],"URL":"https:\/\/doi.org\/10.1145\/3690624.3709310","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}