{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:38:39Z","timestamp":1743079119262,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031478420"},{"type":"electronic","value":"9783031478437"}],"license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47843-7_22","type":"book-chapter","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:27:25Z","timestamp":1699306045000},"page":"315-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Balanced Hop-Constrained Path Enumeration in\u00a0Signed Directed Graphs"],"prefix":"10.1007","author":[{"given":"Zhiyang","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinghao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanping","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Bernstein, A., Chechi, S.: Incremental topological sort and cycle detection in expected total time. In: SODA, pp. 21\u201334 (2018)","DOI":"10.1137\/1.9781611975031.2"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Chen, C., Wu, Y., Sun, R., Wang, X.: Maximum signed $$\\theta $$-clique identification in large signed graphs. IEEE Trans. Knowl. Data Eng. (2021)","DOI":"10.1109\/TKDE.2021.3098423"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Chen, S., Qian, H., Wu, Y., Chen, C., Wang, X.: Efficient adoption maximization in multi-layer social networks. In: ICDMW, pp. 56\u201360 (2019)","DOI":"10.1109\/ICDMW.2019.00017"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Derr, T., Ma, Y., Tang, J.: Signed graph convolutional networks. In: ICDM, pp. 929\u2013934 (2018)","DOI":"10.1109\/ICDM.2018.00113"},{"issue":"7","key":"22_CR5","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.ipl.2008.12.015","volume":"109","author":"Z Gotthilf","year":"2009","unstructured":"Gotthilf, Z., Lewenstein, M.: Improved algorithms for the k simple shortest paths and the replacement paths problems. Inf. Process. Lett. 109(7), 352\u2013355 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F Harary","year":"1953","unstructured":"Harary, F.: On the notion of balance of a signed graph. Mich. Math. J. 2(2), 143\u2013146 (1953)","journal-title":"Mich. Math. J."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Maxel, M., Suri, S.: Finding the k shortest simple paths: a new algorithm and its implementation. TALG 3(4) (2007)","DOI":"10.1145\/1290672.1290682"},{"issue":"11","key":"22_CR8","first-page":"1441","volume":"11","author":"R Kumar","year":"2018","unstructured":"Kumar, R., Calders, T.: 2SCENT: an efficient algorithm to enumerate all simple temporal cycles. PVLDB 11(11), 1441\u20131453 (2018)","journal-title":"PVLDB"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Lai, Z., Peng, Y., Yang, S., Lin, X., Zhang, W.: PEFP: efficient k-hop constrained ST simple path enumeration on FPGA. In: ICDE, pp. 1320\u20131331 (2021)","DOI":"10.1109\/ICDE51399.2021.00118"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: WWW, pp. 641\u2013650 (2010)","DOI":"10.1145\/1772690.1772756"},{"issue":"4","key":"22_CR11","first-page":"463","volume":"13","author":"Y Peng","year":"2019","unstructured":"Peng, Y., Zhang, Y., Lin, X., Zhang, W., Qin, L., Zhou, J.: Hop-constrained ST simple path enumeration: towards bridging theory and practice. PVLDB 13(4), 463\u2013476 (2019)","journal-title":"PVLDB"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, W., Zhang, Y., Lin, X.: Efficient maximum signed biclique identification. In: ICDE, pp. 1313\u20131325 (2023)","DOI":"10.1109\/ICDE55515.2023.00105"},{"issue":"10","key":"22_CR13","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1109\/TKDE.2020.3047224","volume":"34","author":"R Sun","year":"2020","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, Y., Wang, X.: Stable community detection in signed social networks. IEEE Trans. Knowl. Data Eng. 34(10), 5051\u20135055 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Sun, R., Wu, Y., Chen, C., Wang, X., Zhang, W., Lin, X.: Maximal balanced signed biclique enumeration in signed bipartite graphs. In: ICDE, pp. 1887\u20131899 (2022)","DOI":"10.1109\/ICDE53745.2022.00187"},{"key":"22_CR15","unstructured":"Sun, R., Wu, Y., Wang, X.: Diversified top-$$r$$ community search in geo-social network: a k-truss based model. In: EDBT (2022)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Sun, R., Wu, Y., Wang, X., Chen, C., Zhang, W., Lin, X.: Clique identification in signed graphs: a balance theory based model. IEEE Trans. Knowl. Data Eng. (2023)","DOI":"10.1109\/TKDE.2023.3272636"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Sun, S., Chen, Y., He, B., Hooi, B.: Pathenum: towards real-time hop-constrained ST path enumeration. In: SIGMOD, pp. 1758\u20131770 (2021)","DOI":"10.1145\/3448016.3457290"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Tang, J., Aggarwal, C., Liu, H.: Recommendations in signed social networks. In: WWW, pp. 31\u201340 (2016)","DOI":"10.1145\/2872427.2882971"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TKDE.2016.2624734","volume":"29","author":"X Wang","year":"2016","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X., Chen, C.: Bring order into the samples: a novel scalable method for influence maximization. IEEE Trans. Knowl. Data Eng. 29(2), 243\u2013256 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Wu, Y., Sun, R., Chen, C., Wang, X., Fu, X.: Efficiently answering minimum reachable label set queries in edge-labeled graphs. In: CIKM, pp. 4585\u20134589 (2022)","DOI":"10.1145\/3511808.3557593"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Wu, Y., Sun, R., Chen, C., Wang, X., Zhu, Q.: Maximum signed (k, r)-truss identification in signed networks. In: CIKM, pp. 3337\u20133340 (2020)","DOI":"10.1145\/3340531.3417457"},{"issue":"3","key":"22_CR22","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s41019-021-00163-3","volume":"6","author":"Y Wu","year":"2021","unstructured":"Wu, Y., Zhao, J., Sun, R., Chen, C., Wang, X.: Efficient personalized influential community search in large networks. Data Sci. Eng. 6(3), 310\u2013322 (2021)","journal-title":"Data Sci. Eng."},{"key":"22_CR23","unstructured":"Zhang, C., Zhang, Y., Zhang, W., Lin, X., Cheema, M.A., Wang, X.: Diversified spatial keyword search on road networks. In: EDBT (2014)"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, J., Yang, S., Ouyang, D., Zhang, F., Lin, X., Yuan, L.: Hop-constrained ST simple path enumeration on large dynamic graphs. In: ICDE, pp. 762\u2013775 (2023)","DOI":"10.1109\/ICDE55515.2023.00064"},{"issue":"2","key":"22_CR25","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s11280-022-01015-4","volume":"25","author":"X Zhang","year":"2022","unstructured":"Zhang, X., Wang, H., Yu, J., Chen, C., Wang, X., Zhang, W.: Polarity-based graph neural network for sign prediction in signed bipartite graphs. World Wide Web 25(2), 471\u2013487 (2022). https:\/\/doi.org\/10.1007\/s11280-022-01015-4","journal-title":"World Wide Web"}],"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-47843-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:34:17Z","timestamp":1699306457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47843-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"ISBN":["9783031478420","9783031478437"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47843-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"7 November 2023","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":"Melbourne, VIC","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2023","order":10,"name":"conference_id","label":"Conference ID","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","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":"26","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":"0","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":"63% - 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":"2.5","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)"}}]}}