{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T17:17:43Z","timestamp":1770225463266,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819561957","type":"print"},{"value":"9789819561964","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-6196-4_10","type":"book-chapter","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T05:59:23Z","timestamp":1770184763000},"page":"139-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Simple and\u00a0Effective Index for\u00a0Querying Large Quasi-cliques"],"prefix":"10.1007","author":[{"given":"Bide","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huizhong","family":"Cao","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":[[2026,2,5]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader, G.D., Hogue, C.W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinform. 4(1), 2 (2003)","journal-title":"BMC Bioinform."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and MapReduce. arXiv preprint arXiv:1201.6567 (2012)","DOI":"10.14778\/2140436.2140442"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Beutel, A., Xu, W., Guruswami, V., Palow, C., Faloutsos, C.: CopyCatch: stopping group attacks by spotting lockstep behavior in social networks. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 119\u2013130 (2013)","DOI":"10.1145\/2488388.2488400"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Boob, D., et al.: Flowless: extracting densest subgraphs without flow computations. In: Proceedings of The Web Conference 2020, pp. 573\u2013583 (2020)","DOI":"10.1145\/3366423.3380140"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chang, L.: Efficient maximum clique computation over large sparse graphs. In: Proceedings of SIGKDD 2019, pp. 529\u2013538 (2019)","DOI":"10.1145\/3292500.3330986"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Chang, L., Qin, L.: Cohesive Subgraph Computation over Large Sparse Graphs: Algorithms, Data Structures, and Programming Techniques, 1st edn. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03599-0","DOI":"10.1007\/978-3-030-03599-0"},{"key":"10_CR7","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":"10_CR8","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K., Torres, M.R.: Densest subgraph: supermodularity, iterative peeling, and flow. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1531\u20131555. SIAM (2022)","DOI":"10.1137\/1.9781611977073.64"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Epasto, A., Lattanzi, S., Sozio, M.: Efficient densest subgraph computation in evolving graphs. In: Proceedings of the 24th International Conference on World Wide Web, pp. 300\u2013310 (2015)","DOI":"10.1145\/2736277.2741638"},{"key":"10_CR10","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph (1984)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Hooi, B., Song, H.A., Beutel, A., Shah, N., Shin, K., Faloutsos, C.: FRAUDAR: bounding graph fraud in the face of camouflage. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 895\u2013904 (2016)","DOI":"10.1145\/2939672.2939747"},{"key":"10_CR12","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":"10_CR13","doi-asserted-by":"crossref","unstructured":"Konar, A., Sidiropoulos, N.D.: Mining large quasi-cliques with quality guarantees from vertex neighborhoods. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 577\u2013587 (2020)","DOI":"10.1145\/3394486.3403100"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Konar, A., Sidiropoulos, N.D.: Optimal quasi-clique: hardness, equivalence with densest-k-subgraph, and quasi-partitioned community mining. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a038, pp. 8608\u20138616 (2024)","DOI":"10.1609\/aaai.v38i8.28705"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jagm.1994.1032","volume":"17","author":"G Kortsarz","year":"1994","unstructured":"Kortsarz, G., Peleg, D.: Generating sparse 2-spanners. J. Algorithms 17(2), 222\u2013236 (1994)","journal-title":"J. Algorithms"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Manurangsi, P.: Almost-polynomial ratio eth-hardness of approximating densest k-subgraph. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19\u201323 June 2017, pp. 954\u2013961. ACM (2017). https:\/\/doi.org\/10.1145\/3055399.3055412","DOI":"10.1145\/3055399.3055412"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Pang, J., Ma, C., Fang, Y.: A similarity-based approach for efficient large quasi-clique detection. In: Proceedings of the ACM Web Conference 2024, pp. 401\u2013409 (2024)","DOI":"10.1145\/3589334.3645374"},{"issue":"1\u20132","key":"10_CR18","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.dam.2012.07.019","volume":"161","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Veremyev, A., Butenko, S., Boginski, V.: On the maximum quasi-clique problem. Discret. Appl. Math. 161(1\u20132), 244\u2013257 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/net.3230120206","volume":"12","author":"JC Picard","year":"1982","unstructured":"Picard, J.C., Queyranne, M.: A network flow solution to some nonlinear 0\u20131 programming problems, with applications to graph theory. Networks 12(2), 141\u2013159 (1982)","journal-title":"Networks"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Shin, K., Eliassi-Rad, T., Faloutsos, C.: CoreScope: graph mining using k-core analysis\u2013patterns, anomalies and algorithms. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 469\u2013478. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0058"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 104\u2013112 (2013)","DOI":"10.1145\/2487575.2487645"}],"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-981-95-6196-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T05:59:29Z","timestamp":1770184769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6196-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819561957","9789819561964"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6196-4_10","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":"5 February 2026","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":"Sydney","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc-conference.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}