{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T22:59:08Z","timestamp":1781045948956,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819572502","type":"print"},{"value":"9789819572519","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-7251-9_25","type":"book-chapter","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T22:31:17Z","timestamp":1781044277000},"page":"375-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counting the\u00a0Number of\u00a0Hop-Constrained Simple S-T Paths in\u00a0Large Graphs"],"prefix":"10.1007","author":[{"given":"Bocheng","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zebin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weizhang","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yizhe","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Shepherd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1772-6863","authenticated-orcid":false,"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Cai, Y., Liu, S., Zheng, W., Lin, X., Zhang, C., Zhang, X.: Generating $$k$$-hop-constrained $$s$$-$$t$$ path graphs. IEEE Trans. Knowl. Data Eng. PP, 1\u201314 (2025). https:\/\/doi.org\/10.1109\/TKDE.2025.3532318","DOI":"10.1109\/TKDE.2025.3532318"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Z., Chen, K., Wen, D., Yang, Z., Li, W., Zhang, Y.: Accelerating shortest path counting on road networks. In: 2025 IEEE 41st International Conference on Data Engineering (ICDE), pp. 3508\u20133521. IEEE (2025)","DOI":"10.1109\/ICDE65448.2025.00262"},{"issue":"11","key":"25_CR3","doi-asserted-by":"publisher","first-page":"6003","DOI":"10.3390\/app15116003","volume":"15","author":"Z Chen","year":"2025","unstructured":"Chen, Z., Liang, K., Yuan, L., Zhang, W., Yang, Z.: Recent advances in efficient dynamic graph processing. Appl. Sci. 15(11), 6003 (2025)","journal-title":"Appl. Sci."},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"4","key":"25_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"GY Handler","year":"1980","unstructured":"Handler, G.Y., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks 10(4), 293\u2013310 (1980). https:\/\/doi.org\/10.1002\/net.3230100403","journal-title":"Networks"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"He, H., Yet al.: A survey on efficient graph reachability queries. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 58\u201377. Springer, Cham (2025)","DOI":"10.1007\/978-981-96-8295-9_4"},{"issue":"6","key":"25_CR7","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput. 4(1), 77\u201384 (1975)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01086243","volume":"24","author":"NP Khomenko","year":"1972","unstructured":"Khomenko, N.P., Golovko, L.D.: Identifying certain types of parts of a graph and computing their number. Ukr. Math. J. 24(3), 313\u2013321 (1972)","journal-title":"Ukr. Math. J."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Kumar, R., Calders, T.: An efficient algorithm to enumerate all simple temporal cycles. In: Proceedings of the VLDB Endowment, vol.\u00a011, pp. 1233\u20131244 (2018)","DOI":"10.14778\/3236187.3269460"},{"key":"25_CR11","unstructured":"Leskovec, J., Krevl, A.: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data\/"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Li, X., Hao, K., Yang, Z., Cao, X., Zhang, W.: Hop-constrained s-t simple path enumeration in large uncertain graphs. In: Hua, W., Wang, H., Li, L. (eds.) Australasian Database Conference, pp. 115\u2013127. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15512-3_9","DOI":"10.1007\/978-3-031-15512-3_9"},{"key":"25_CR13","doi-asserted-by":"publisher","unstructured":"Li, X., et al.: Hop-constrained s-t simple path enumeration in billion-scale labelled graphs. In: Chbeir, R., Huang, H., Silvestri, F., Manolopoulos, Y., Zhang, Y. (eds.) International Conference on Web Information Systems Engineering. pp. 49\u201364. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20891-1_5","DOI":"10.1007\/978-3-031-20891-1_5"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Peng, Y., Zhang, Y., Lin, X., Zhang, W., Qin, L.: Hop-constrained s-t simple path enumeration: Towards bridging theory and practice. In: Proceedings of the VLDB Endowment, vol.\u00a013, pp. 463\u2013476 (2019)","DOI":"10.14778\/3372716.3372720"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Punzi, G., Conte, A., Grossi, R., Marino, A.: An efficient algorithm for assessing the number of st-paths in large graphs. In: Proceedings of the SIAM International Conference on Data Mining (SDM), pp. 289\u2013297 (2023)","DOI":"10.1137\/1.9781611977653.ch33"},{"issue":"3","key":"25_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"RC Read","year":"1975","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5(3), 237\u2013252 (1975)","journal-title":"Networks"},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.7155\/jgaa.00142","volume":"11","author":"B Roberts","year":"2007","unstructured":"Roberts, B., Kroese, D.: Estimating the number of s-t paths in a graph. J. Graph Algorithms Appl. 11(1), 195\u2013214 (2007)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Sun, S., Chen, Y., He, B., Hooi, B.: Pathenum: Towards real-time hop-constrained s-t path enumeration. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1571\u20131583 (2021)","DOI":"10.1145\/3448016.3457290"},{"issue":"1","key":"25_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(83)90038-8","volume":"16","author":"RE Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Finding all minimum-cost paths in a graph. Inf. Process. Lett. 16(1), 17\u201319 (1983). https:\/\/doi.org\/10.1016\/0020-0190(83)90038-8","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"25_CR20","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Zeng, Y., Fang, Y., Ma, C., Zhou, X., Li, K.: Efficient distributed hop-constrained path enumeration on large-scale graphs. Proc. ACM Manage. Data 2, 1\u201325 (2024). https:\/\/doi.org\/10.1145\/3639277","DOI":"10.1145\/3639277"},{"key":"25_CR22","unstructured":"Zhang, F., Wang, W., Li, G.: Net approach to enumerate all simple paths in a graph. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 857\u2013872 (2018)"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7251-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T22:31:19Z","timestamp":1781044279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7251-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819572502","9789819572519"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7251-9_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":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"15 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2025.ficloud.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}