{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:43:39Z","timestamp":1743011019471,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"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_26","type":"book-chapter","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:27:25Z","timestamp":1699306045000},"page":"371-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Directed Densest Subgraph Detection"],"prefix":"10.1007","author":[{"given":"Kai","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"issue":"4","key":"26_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.physrep.2013.08.002","volume":"533","author":"FD Malliaros","year":"2013","unstructured":"Malliaros, F.D., Vazirgiannis, M.: Clustering and community detection in directed networks: a survey. Phys. Rep. 533(4), 95\u2013142 (2013)","journal-title":"Phys. Rep."},{"key":"26_CR2","unstructured":"Kannan, R., Vinay, V.: Analyzing the structure of large graphs. Universit\u00e4t Bonn. Institut f\u00fcr \u00d6konometrie und Operations Research (1999)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-642-02927-1_50","volume-title":"Automata, Languages and Programming","author":"S Khuller","year":"2009","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 597\u2013608. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_50"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Yang, J., McAuley, J., Leskovec, J.: Detecting cohesive and 2-mode communities indirected and undirected networks. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, pp. 323\u2013332 (2014)","DOI":"10.1145\/2556195.2556243"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Sawlani, S., Wang, J.: Near-optimal fully dynamic densest subgraph. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 181\u2013193 (2020)","DOI":"10.1145\/3357713.3384327"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V.S., Zhang, W., Lin, X.: Efficient algorithms for densest subgraph discovery on large directed graphs. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, SIGMOD 2020, New York, NY, USA, pp. 1051\u20131066. Association for Computing Machinery (2020)","DOI":"10.1145\/3318464.3389697"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: Proceedings of the 2008 International Conference on Web Search and Data Mining, pp. 95\u2013106 (2008)","DOI":"10.1145\/1341531.1341547"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and mapreduce. Proc. VLDB Endow. 5(5) (2012)","DOI":"10.14778\/2140436.2140442"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Gionis, A., Tsourakakis, C.E.: Dense subgraph discovery: KDD 2015 tutorial. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2015, New York, NY, USA, pp. 2313\u20132314. Association for Computing Machinery (2015)","DOI":"10.1145\/2783258.2789987"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"key":"26_CR11","unstructured":"Batagelj, V., Zaversnik, M.: An o (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)"},{"key":"26_CR12","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph (1984)"},{"issue":"11","key":"26_CR13","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.14778\/3342263.3342645","volume":"12","author":"Y Fang","year":"2019","unstructured":"Fang, Y., Yu, K., Cheng, R., Lakshmanan, L.V.S., Lin, X.: Efficient algorithms for densest subgraph discovery. Proc. VLDB Endow. 12(11), 1719\u20131732 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: The k-clique densest subgraph problem. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1122\u20131132 (2015)","DOI":"10.1145\/2736277.2741098"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Sun, B., Danisch, M., Chan, T.H.H., Sozio, M.: KClist++: a simple algorithm for finding k-clique densest subgraphs in large graphs. Proc. VLDB Endow. (PVLDB) (2020)","DOI":"10.14778\/3401960.3401962"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Qin, L., Li, R.-H., Chang, L., Zhang, C.: Locally densest subgraph discovery. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 965\u2013974 (2015)","DOI":"10.1145\/2783258.2783299"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Trung, T.B., Chang, L., Long, N.T., Yao, K., Binh, H.T.T.: Verification-free approaches to efficient locally densest subgraph discovery. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 1\u201313. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00008"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-95995-3_3","volume-title":"Algorithms and Models for the Web-Graph","author":"R Andersen","year":"2009","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 25\u201337. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-95995-3_3"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Pachocki, J., Peng, R., Tsourakakis, C., Xu, S.C.: Scalable large near-clique detection in large-scale networks via sampling. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 815\u2013824 (2015)","DOI":"10.1145\/2783258.2783385"}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:34:50Z","timestamp":1699306490000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47843-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"ISBN":["9783031478420","9783031478437"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47843-7_26","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)"}}]}}