{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:13:01Z","timestamp":1742973181391,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031155116"},{"type":"electronic","value":"9783031155123"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15512-3_9","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T04:02:55Z","timestamp":1661486575000},"page":"115-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hop-Constrained s-t Simple Path Enumeration in\u00a0Large Uncertain Graphs"],"prefix":"10.1007","author":[{"given":"Xia","family":"Li","sequence":"first","affiliation":[]},{"given":"Kongzhang","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,27]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-319-77404-6_40","volume-title":"LATIN 2018: Theoretical Informatics","author":"R Grossi","year":"2018","unstructured":"Grossi, R., Marino, A., Versari, L.: Efficient algorithms for listing k disjoint st-paths in graphs. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 544\u2013557. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_40"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Kawahigashi, H., Terashima, Y., Miyauchi, N., Nakakawaji, T.: Modeling ad hoc sensor networks using random graph theory. In: Second IEEE Consumer Communications and Networking Conference, CCNC 2005, pp. 104\u2013109 (2005). https:\/\/doi.org\/10.1109\/CCNC.2005.1405152","DOI":"10.1109\/CCNC.2005.1405152"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Leser, U.: A query language for biological networks. In: ECCB\/JBI\u201905 Proceedings, Fourth European Conference on Computational Biology\/Sixth Meeting of the Spanish Bioinformatics Network (Jornadas de BioInform\u00e1tica), Palacio de Congresos, Madrid, Spain, 28 September\u20131 October 2005, p. 39 (2005). https:\/\/doi.org\/10.1093\/bioinformatics\/bti1105","DOI":"10.1093\/bioinformatics\/bti1105"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management, CIKM 2003, pp. 556\u2013559. Association for Computing Machinery, New York (2003)","DOI":"10.1145\/956863.956972"},{"issue":"4","key":"9_CR5","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., Zhang, W., Qin, L., Zhou, J.: 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."},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Qiu, X., et al.: Real-time constrained cycle detection in large dynamic graphs. Proc. VLDB Endow. 11(12), 1876\u20131888 (2018). https:\/\/doi.org\/10.14778\/3229863.3229874","DOI":"10.14778\/3229863.3229874"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-319-19315-1_28","volume-title":"Combinatorial Algorithms","author":"R Rizzi","year":"2015","unstructured":"Rizzi, R., Sacomoto, G., Sagot, M.-F.: Efficiently listing bounded length st-paths. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 318\u2013329. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19315-1_28"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11799511_5","volume-title":"Data Integration in the Life Sciences","author":"P Sevon","year":"2006","unstructured":"Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link discovery in graphs derived from biological databases. In: Leser, U., Naumann, F., Eckman, B. (eds.) DILS 2006. LNCS, vol. 4075, pp. 35\u201349. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799511_5"},{"key":"9_CR9","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 SIGMOD, pp. 1758\u20131770 (2021)","DOI":"10.1145\/3448016.3457290"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15512-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T04:04:15Z","timestamp":1661486655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15512-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031155116","9783031155123"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15512-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sidney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc2022.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}