{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T06:30:03Z","timestamp":1790749803518,"version":"4.1.0"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T00:00:00Z","timestamp":1715126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T00:00:00Z","timestamp":1715126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62302421"],"award-info":[{"award-number":["62302421"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62102341"],"award-info":[{"award-number":["62102341"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Basic and Applied Basic Research Fund in Guangdong Province","award":["2023A1515011280"],"award-info":[{"award-number":["2023A1515011280"]}]},{"name":"Basic and Applied Basic Research Fund in Guangdong Province","award":["2022A1515010166"],"award-info":[{"award-number":["2022A1515010166"]}]},{"name":"Guangdong Talent Program","award":["2021QN02X826"],"award-info":[{"award-number":["2021QN02X826"]}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["JCYJ20220530143602006"],"award-info":[{"award-number":["JCYJ20220530143602006"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["ZDSYS20211021111415025"],"award-info":[{"award-number":["ZDSYS20211021111415025"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["ZDSYS20211021111415025"],"award-info":[{"award-number":["ZDSYS20211021111415025"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00778-024-00855-y","type":"journal-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T12:01:46Z","timestamp":1715169706000},"page":"1427-1452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient and effective algorithms for densest subgraph discovery and maintenance"],"prefix":"10.1007","volume":"33","author":[{"given":"Yichen","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3243-8512","authenticated-orcid":false,"given":"Chenhao","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yixiang","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhifeng","family":"Bao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,8]]},"reference":[{"key":"855_CR1","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0097539791199334","volume":"23","author":"R Ahuja","year":"1994","unstructured":"Ahuja, R., Orlin, J., Stein, C., Tarjan, R.: Improved algorithms for bipartite network flow. SIAM J. Comput. 23, 906\u2013933 (1994)","journal-title":"SIAM J. Comput."},{"key":"855_CR2","doi-asserted-by":"crossref","unstructured":"Alper, B., Bach, B., Riche, N.H., Isenberg, T., Fekete, J.-D.: Weighted graph comparison techniques for brain connectivity analysis. In: CHI, pages 483\u2013492. Association for Computing Machinery (2013)","DOI":"10.1145\/2470654.2470724"},{"key":"855_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: Algorithms and Models for the Web-Graph, pages 25\u201337. Springer Berlin Heidelberg (2009)","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"855_CR4","doi-asserted-by":"crossref","unstructured":"Anderson, R.J., Setubal, J.C.: On the parallel implementation of goldberg\u2019s maximum flow algorithm. In: SPAA, page 168\u2013177. ACM (1992)","DOI":"10.1145\/140901.140919"},{"key":"855_CR5","doi-asserted-by":"crossref","unstructured":"Aridhi, S., Brugnara, M., Montresor, A., Velegrakis, Y.: Distributed k-core decomposition and maintenance in large dynamic graphs. In: Proceedings of the 10th ACM International Conference on Distributed and Event-Based Systems, DEBS \u201916, page 161\u2013168, New York, NY, USA, (2016). Association for Computing Machinery","DOI":"10.1145\/2933267.2933299"},{"key":"855_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithms 34, 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"issue":"1\u20133","key":"855_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discrete Appl. Math. 121(1\u20133), 15\u201326 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"855_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discret. Appl. Math. 121(1), 15\u201326 (2002)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"855_CR9","first-page":"454","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and mapreduce. PVLDB 5(5), 454\u2013465 (2012)","journal-title":"PVLDB"},{"key":"855_CR10","doi-asserted-by":"crossref","unstructured":"Bera, S.K., Bhattacharya, S., Choudhari, J., Ghosh, P.: A new dynamic algorithm for densest subhypergraphs. In: WWW, pages 1093\u20131103 (2022)","DOI":"10.1145\/3485447.3512158"},{"key":"855_CR11","doi-asserted-by":"crossref","unstructured":"Boob, D., Gao, Y., Peng, R., Sawlani, S., Tsourakakis, C.E., Wang, D., Wang, J.: Flowless: extracting densest subgraphs without flow computations. In: WWW, pages 573\u2013583. ACM \/ IW3C2 (2020)","DOI":"10.1145\/3366423.3380140"},{"key":"855_CR12","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Approximation Algorithms for Combinatorial Optimization, pages 84\u201395. Springer Berlin Heidelberg (2000)","DOI":"10.1007\/3-540-44436-X_10"},{"key":"855_CR13","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, Kent, T., Manuel R.: Densest Subgraph: Supermodularity, Iterative Peeling, and Flow, pages 1531\u20131555 (2022)","DOI":"10.1137\/1.9781611977073.64"},{"key":"855_CR14","first-page":"1216","volume":"24","author":"J Chen","year":"2012","unstructured":"Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. TKDE 24, 1216\u20131230 (2012)","journal-title":"TKDE"},{"key":"855_CR15","doi-asserted-by":"crossref","unstructured":"Chen, T., Tsourakakis, C.: Antibenford subgraphs: Unsupervised anomaly detection in financial networks. In: KDD, pages 2762\u20132770 (2022)","DOI":"10.1145\/3534678.3539100"},{"key":"855_CR16","unstructured":"Conti, E., Cao, S., Thomas, A.J.: Disruptions in the us airport network. arXiv, (2013)"},{"key":"855_CR17","doi-asserted-by":"crossref","unstructured":"Danisch, M., Hubert Chan, T.-H., Sozio, M.: Large scale density-friendly graph decomposition via convex programming. In: WWW, pages 233\u2013242. ACM (2017)","DOI":"10.1145\/3038912.3052619"},{"key":"855_CR18","doi-asserted-by":"crossref","unstructured":"Dinitz, Y: Dinitz\u2019algorithm: The original version and even\u2019s version. In: Theoretical Computer Science: Essays in Memory of Shimon Even, pages 218\u2013240. Springer (2006)","DOI":"10.1007\/11685654_10"},{"key":"855_CR19","doi-asserted-by":"crossref","unstructured":"Du, X., Jin, R., Ding, L., Lee, V.E., Thornton Jr., J.H.: Migration motif: a spatial - temporal pattern mining approach for financial markets. In: KDD, pages 1135\u20131144. ACM (2009)","DOI":"10.1145\/1557019.1557142"},{"key":"855_CR20","doi-asserted-by":"publisher","first-page":"062819","DOI":"10.1103\/PhysRevE.88.062819","volume":"88","author":"M Eidsaa","year":"2013","unstructured":"Eidsaa, M., Almaas, E.: $$s$$-core network decomposition: a generalization of $$k$$-core analysis to weighted networks. Phys. Rev. E 88, 062819 (2013)","journal-title":"Phys. Rev. E"},{"key":"855_CR21","doi-asserted-by":"crossref","unstructured":"Epasto, A., Lattanzi, S., Sozio, M.: Efficient densest subgraph computation in evolving graphs. In: WWW, pages 300\u2013310. ACM (2015)","DOI":"10.1145\/2736277.2741638"},{"issue":"11","key":"855_CR22","first-page":"1719","volume":"12","author":"Y Fang","year":"2019","unstructured":"Fang, Y., Kaiqiang, Yu., Cheng, R., Lakshmanan, L.V.S., Lin, X.: Efficient algorithms for densest subgraph discovery. PVLDB 12(11), 1719\u20131732 (2019)","journal-title":"PVLDB"},{"issue":"12","key":"855_CR23","first-page":"3766","volume":"15","author":"Y Fang","year":"2022","unstructured":"Fang, Y., Luo, W., Ma, C.: Densest subgraph discovery on large graphs: applications, challenges, and techniques. PVLDB 15(12), 3766\u20133769 (2022)","journal-title":"PVLDB"},{"issue":"3","key":"855_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica 29(3), 12 (2001)","journal-title":"Algorithmica"},{"key":"855_CR25","doi-asserted-by":"crossref","unstructured":"Feng, W., Liu, S., Koutra, D., Shen, H., Cheng, X.: Specgreedy: unified dense subgraph detection. In: ECML\/PKDD, pages 181\u2013197. Springer-Verlag (2020)","DOI":"10.1007\/978-3-030-67658-2_11"},{"issue":"14","key":"855_CR26","doi-asserted-by":"publisher","first-page":"e150","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin, E., Naughton, B.T., Brutlag, D.L., Batzoglou, S.: Motifcut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14), e150\u2013e7 (2006)","journal-title":"Bioinformatics"},{"key":"855_CR27","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: PVLDB, pages 721\u2013732. ACM (2005)"},{"key":"855_CR28","doi-asserted-by":"crossref","unstructured":"Gionis, A., Tsourakakis, C.E.: Dense subgraph discovery: Kdd 2015 tutorial. In: KDD, pages 2313\u20132314. ACM (2015)","DOI":"10.1145\/2783258.2789987"},{"key":"855_CR29","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph (1984)"},{"issue":"3","key":"855_CR30","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"AV Goldberg","year":"1990","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15(3), 430\u2013466 (1990)","journal-title":"Math. Oper. Res."},{"key":"855_CR31","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"AV Goldberg","year":"1990","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15, 430\u2013466 (1990)","journal-title":"Math. Oper. Res."},{"key":"855_CR32","doi-asserted-by":"crossref","unstructured":"He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Scaling up k-clique densest subgraph detection. PACMMOD, 1(1), (2023)","DOI":"10.1145\/3588923"},{"key":"855_CR33","doi-asserted-by":"crossref","unstructured":"Hooi, B., Song, H.A.H., Beutel, A., Shah, N., Shin, K., Faloutsos, C.: FRAUDAR: bounding graph fraud in the face of camouflage. In: KDD, pages 895\u2013904. ACM (2016)","DOI":"10.1145\/2939672.2939747"},{"key":"855_CR34","doi-asserted-by":"crossref","unstructured":"Hu, S., Wu, X., Hubert Chan, T.-H.: Maintaining densest subsets efficiently in evolving hypergraphs. In: CIKM, pages 929\u2013938. ACM (2017)","DOI":"10.1145\/3132847.3132907"},{"key":"855_CR35","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pages 1311\u20131322. ACM (2014)","DOI":"10.1145\/2588555.2610495"},{"key":"855_CR36","doi-asserted-by":"crossref","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: Automata, Languages and Programming, pages 597\u2013608. Springer Berlin Heidelberg (2009)","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"855_CR37","doi-asserted-by":"crossref","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tompkins, A., Upfal, E.: The web as a graph. In: PODS, pages 1\u201310. ACM (2000)","DOI":"10.1145\/335168.335170"},{"key":"855_CR38","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: stanford large network dataset collection, (2014)"},{"issue":"2","key":"855_CR39","doi-asserted-by":"publisher","first-page":"172605","DOI":"10.1007\/s11704-022-1462-5","volume":"17","author":"N Li","year":"2023","unstructured":"Li, N., Zhu, H., Wenhao, L., Cui, N., Liu, W., Yin, J., Jianliang, X., Lee, W.-C.: The most tenuous group query. Front. Comp. Sci. 17(2), 172605 (2023)","journal-title":"Front. Comp. Sci."},{"issue":"5","key":"855_CR40","first-page":"757","volume":"14","author":"Z Lin","year":"2021","unstructured":"Lin, Z., Zhang, F., Lin, X., Zhang, W., Tian, Z.: Hierarchical core maintenance on large dynamic graphs. PVLDB 14(5), 757\u2013770 (2021)","journal-title":"PVLDB"},{"key":"855_CR41","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: SIGMOD, pages 1051\u20131066. ACM (2020)","DOI":"10.1145\/3318464.3389697"},{"key":"855_CR42","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: SIGMOD, pages 1051\u20131066 (2020)","DOI":"10.1145\/3318464.3389697"},{"issue":"4","key":"855_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3483940","volume":"46","author":"C Ma","year":"2021","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V.S., Zhang, W., Lin, X.: On directed densest subgraph discovery. TODS 46(4), 1\u201345 (2021)","journal-title":"TODS"},{"issue":"11","key":"855_CR44","first-page":"2719","volume":"15","author":"C Ma","year":"2022","unstructured":"Ma, C., Cheng, R., Lakshmanan, L.V.S., Han, X.: Finding locally densest subgraphs: A convex programming approach. PVLDB 15(11), 2719\u20132732 (2022)","journal-title":"PVLDB"},{"key":"855_CR45","doi-asserted-by":"crossref","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V.S., Han, X.: A convex-programming approach for efficient directed densest subgraph discovery. In: SIGMOD, pages 845\u2013859 (2022)","DOI":"10.1145\/3514221.3517837"},{"key":"855_CR46","doi-asserted-by":"crossref","unstructured":"Manurangsi, P.: Inapproximability of maximum biclique problems, minimum k-cut and densest at-least-k-subgraph from the small set expansion hypothesis. (2018). arXiv:1705.03581","DOI":"10.3390\/a11010010"},{"key":"855_CR47","doi-asserted-by":"crossref","unstructured":"Mathieu, C., de Rougemont, M.: Large very dense subgraphs in a stream of edges (2020)","DOI":"10.1145\/3412815.3416884"},{"key":"855_CR48","doi-asserted-by":"crossref","unstructured":"McGregor, A., Tench, D., Vorotnikova, S., Vu, H.T.: Densest subgraph in dynamic graph streams. In: International Symposium on Mathematical Foundations of Computer Science, volume 9235, pages 472\u2013482. Springer (2015)","DOI":"10.1007\/978-3-662-48054-0_39"},{"issue":"2","key":"855_CR49","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1073\/pnas.98.2.404","volume":"98","author":"MEJ Newman","year":"2001","unstructured":"Newman, M.E.J.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. 98(2), 404\u2013409 (2001)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"855_CR50","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","volume":"32","author":"T Opsahl","year":"2010","unstructured":"Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: generalizing degree and shortest paths. Social Netw. 32(3), 245\u2013251 (2010)","journal-title":"Social Netw."},{"issue":"2","key":"855_CR51","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","volume":"35","author":"T Opsahl","year":"2013","unstructured":"Opsahl, T.: Triadic closure in two-mode networks: redefining the global and local clustering coefficients. Social Netw. 35(2), 159\u2013167 (2013)","journal-title":"Social Netw."},{"key":"855_CR52","doi-asserted-by":"crossref","unstructured":"Qin, L., Li, R.-H., Chang, L., Zhang, C.: Locally densest subgraph discovery. In: KDD, pages 965\u2013974 (2015)","DOI":"10.1145\/2783258.2783299"},{"key":"855_CR53","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"855_CR54","doi-asserted-by":"crossref","unstructured":"Saha, A., Ke, X., Khan, A., Long, C.: Most probable densest subgraphs. In: ICDE, pages 1447\u20131460. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00115"},{"key":"855_CR55","unstructured":"Sarma, A.D., Lall, A., Nanongkai, D., Trehan, A.: Dense subgraphs on dynamic networks. arXiv (2012)"},{"key":"855_CR56","doi-asserted-by":"crossref","unstructured":"Sawlani, S., Wang, J.: Near-optimal fully dynamic densest subgraph. In: STOC, pages 181\u2013193. ACM (2020)","DOI":"10.1145\/3357713.3384327"},{"issue":"3","key":"855_CR57","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Social Netw. 5(3), 269\u2013287 (1983)","journal-title":"Social Netw."},{"issue":"2","key":"855_CR58","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0196-6774(82)90013-X","volume":"3","author":"Y Shiloach","year":"1982","unstructured":"Shiloach, Y., Vishkin, U.: An o(n2log n) parallel max-flow algorithm. J. Algorithms 3(2), 128\u2013146 (1982)","journal-title":"J. Algorithms"},{"key":"855_CR59","doi-asserted-by":"crossref","unstructured":"Tang, J.K., Leontiadis, I., Scellato, S., Nicosia, V., Mascolo, C., Musolesi, M., Latora, V.: Applications of temporal graph metrics to real-world networks. CoRR, arXiv:1305.6974 (2013)","DOI":"10.1007\/978-3-642-36461-7_7"},{"issue":"6","key":"855_CR60","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0167-6377(84)90076-2","volume":"2","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E.: A simple version of karzanov\u2019s blocking flow algorithm. Oper. Res. Lett. 2(6), 265\u2013268 (1984)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"855_CR61","first-page":"54:1","volume":"13","author":"N Tatti","year":"2019","unstructured":"Tatti, N.: Density-friendly graph decomposition. ACM TKDD 13(5), 54:1-54:29 (2019)","journal-title":"ACM TKDD"},{"key":"855_CR62","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: The k-clique densest subgraph problem. In: WWW, page 1122\u20131132. IW3C2, (2015)","DOI":"10.1145\/2736277.2741098"},{"key":"855_CR63","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: The k-clique densest subgraph problem. In: WWW, pages 1122\u20131132. ACM, (2015)","DOI":"10.1145\/2736277.2741098"},{"key":"855_CR64","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.A.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: KDD, pages 104\u2013112. ACM, (2013)","DOI":"10.1145\/2487575.2487645"},{"key":"855_CR65","unstructured":"Ugander, J., Karrer, B., Backstrom, L., Marlow, C.: The anatomy of the facebook social graph. arXiv, (2011)"},{"key":"855_CR66","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0219633602000117","volume":"01","author":"S Vishveshwara","year":"2002","unstructured":"Vishveshwara, S., Brinda, K.V., Kannan, N.: Protein structure: insights from graph theory. J. Theor. Comput. Chem. 01, 187\u2013211 (2002)","journal-title":"J. Theor. Comput. Chem."},{"key":"855_CR67","doi-asserted-by":"crossref","unstructured":"Shijie, X., Fang, J., Li, X.: Weighted laplacian method and its theoretical applications. IOP Conf. Ser. Mater. Sci. Eng. 768(7), 072032 (2020)","DOI":"10.1088\/1757-899X\/768\/7\/072032"},{"issue":"2","key":"855_CR68","first-page":"169:1","volume":"1","author":"X Yichen","year":"2023","unstructured":"Yichen, X., Ma, C., Fang, Y., Bao, Z.: Efficient and effective algorithms for generalized densest subgraph discovery. PACMMOD 1(2), 169:1-169:27 (2023)","journal-title":"PACMMOD"},{"key":"855_CR69","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X., Zhang, Y., Qin, L.: A fast order-based approach for core maintenance. In: ICDE, pages 337\u2013348. IEEE Computer Society, (2017)","DOI":"10.1109\/ICDE.2017.93"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00855-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00855-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00855-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T12:04:16Z","timestamp":1723896256000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00855-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,8]]},"references-count":69,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["855"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00855-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,8]]},"assertion":[{"value":"26 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}