{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:04:31Z","timestamp":1767312271753,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819539055","type":"print"},{"value":"9789819539062","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-95-3906-2_20","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:00:09Z","timestamp":1767312009000},"page":"297-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ShareDP: Finding k Disjoint Paths for\u00a0Multiple Vertex Pairs"],"prefix":"10.1007","author":[{"given":"Zhiqiu","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youhuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linglin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Cheng, B., et al.: Independent spanning trees in networks: a survey. ACM Comput. Surv. 55(14s), 335:1\u2013335:29 (2023). https:\/\/doi.org\/10.1145\/3591110","DOI":"10.1145\/3591110"},{"issue":"5","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1007\/S00778-020-00604-X","volume":"29","author":"T Chondrogiannis","year":"2020","unstructured":"Chondrogiannis, T., et al.: Finding k-shortest paths with limited overlap. VLDB J. 29(5), 1023\u20131047 (2020). https:\/\/doi.org\/10.1007\/S00778-020-00604-X","journal-title":"VLDB J."},{"issue":"5","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1137\/S0097539703436734","volume":"35","author":"S Curran","year":"2006","unstructured":"Curran, S., et al.: Finding four independent trees. SIAM J. Comput. 35(5), 1023\u20131058 (2006). https:\/\/doi.org\/10.1137\/S0097539703436734","journal-title":"SIAM J. Comput."},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S Even","year":"1975","unstructured":"Even, S., et al.: Network flow and testing graph connectivity. SIAM J. Comput. 4(4), 507\u2013518 (1975)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"20_CR5","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1080\/00207176708921826","volume":"6","author":"IT Frisch","year":"1967","unstructured":"Frisch, I.T.: An algorithm for vertex-pair connectivity. Int. J. Control 6(6), 579\u2013593 (1967)","journal-title":"Int. J. Control"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TNET.2008.919323","volume":"17","author":"G Jayavelu","year":"2009","unstructured":"Jayavelu, G., et al.: Maintaining colored trees for disjoint multipath routing under node failures. IEEE\/ACM Trans. Netw. 17(1), 346\u2013359 (2009)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Li, L., et al.: Fast query decomposition for batch shortest path processing in road networks. In: ICDE 2020, pp. 1189\u20131200. IEEE (2020). https:\/\/doi.org\/10.1109\/ICDE48307.2020.00107","DOI":"10.1109\/ICDE48307.2020.00107"},{"issue":"11","key":"20_CR8","doi-asserted-by":"publisher","first-page":"5552","DOI":"10.1109\/TKDE.2021.3063717","volume":"34","author":"L Li","year":"2022","unstructured":"Li, L., et al.: Comparing alternative route planning techniques: a comparative user study on melbourne, dhaka and copenhagen road networks. IEEE Trans. Knowl. Data Eng. 34(11), 5552\u20135557 (2022). https:\/\/doi.org\/10.1109\/TKDE.2021.3063717","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"7","key":"20_CR9","doi-asserted-by":"publisher","first-page":"3255","DOI":"10.1109\/TVT.2012.2205284","volume":"61","author":"A Liu","year":"2012","unstructured":"Liu, A., et al.: Secure and energy-efficient disjoint multipath routing for WSNS. IEEE Trans. Veh. Technol 61(7), 3255\u20133265 (2012)","journal-title":"IEEE Trans. Veh. Technol"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/3446980","volume":"46","author":"A Mhedhbi","year":"2021","unstructured":"Mhedhbi, A., et al.: Optimizing one-time and continuous subgraph queries using worst-case optimal joins. ACM Trans. Database Syst. 46(2), 6:1-6:45 (2021). https:\/\/doi.org\/10.1145\/3446980","journal-title":"ACM Trans. Database Syst."},{"issue":"5","key":"20_CR11","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/S00778-021-00674-5","volume":"30","author":"Y Peng","year":"2021","unstructured":"Peng, Y., et al.: Efficient hop-constrained s-t simple path enumeration. VLDB J. 30(5), 799\u2013823 (2021). https:\/\/doi.org\/10.1007\/S00778-021-00674-5","journal-title":"VLDB J."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y Shiloach","year":"1978","unstructured":"Shiloach, Y., et al.: Finding two disjoint paths between two pairs of vertices in a graph. J. ACM (JACM) 25(1), 1\u20139 (1978)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"JW Suurballe","year":"1974","unstructured":"Suurballe, J.W.: Disjoint paths in a network. Networks 4(2), 125\u2013145 (1974)","journal-title":"Networks"},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.14778\/2735496.2735507","volume":"8","author":"M Then","year":"2014","unstructured":"Then, M., et al.: The more the merrier: efficient multi-source graph traversal. Proc. VLDB Endow. 8(4), 449\u2013460 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Yuan, L., et al.: Batch hop-constrained s-t simple path query processing in large graphs. In: ICDE 2024, pp. 2557\u20132569. IEEE (2024). https:\/\/doi.org\/10.1109\/ICDE60146.2024.00201","DOI":"10.1109\/ICDE60146.2024.00201"},{"key":"20_CR16","unstructured":"Yuan, Z., et al.: ShareDP: Finding k Disjoint Paths for Multiple Vertex Pairs (2025). https:\/\/arxiv.org\/abs\/2502.16506"}],"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-95-3906-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:00:10Z","timestamp":1767312010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3906-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819539055","9789819539062"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3906-2_20","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":"2 January 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":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2025.github.io","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}