{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:08:34Z","timestamp":1775912914859,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T00:00:00Z","timestamp":1690761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T00:00:00Z","timestamp":1690761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100022813","name":"The Chinese University of Hong Kong, Shenzhen","doi-asserted-by":"crossref","award":["UDF01002775"],"award-info":[{"award-number":["UDF01002775"]}],"id":[{"id":"10.13039\/100022813","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2023A1515011280"],"award-info":[{"award-number":["2023A1515011280"]}],"id":[{"id":"10.13039\/501100021171","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":["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":["2022A1515010166"],"award-info":[{"award-number":["2022A1515010166"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62202412"],"award-info":[{"award-number":["62202412"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s00778-023-00805-0","type":"journal-article","created":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T13:02:19Z","timestamp":1690808539000},"page":"207-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Accelerating directed densest subgraph queries with software and hardware approaches"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3243-8512","authenticated-orcid":false,"given":"Chenhao","family":"Ma","sequence":"first","affiliation":[]},{"given":"Yixiang","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Reynold","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Laks V. S.","family":"Lakshmanan","sequence":"additional","affiliation":[]},{"given":"Xiaolin","family":"Han","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,31]]},"reference":[{"key":"805_CR1","unstructured":"Administration, F.A.: Air traffic control system command center. https:\/\/www.faa.gov (2019)"},{"issue":"6749","key":"805_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Internet: diameter of the world-wide web. Nature 401(6749), 130 (1999)","journal-title":"Nature"},{"issue":"2","key":"805_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00778-013-0340-z","volume":"23","author":"A Angel","year":"2014","unstructured":"Angel, A., Koudas, N., Sarkas, N., Srivastava, D., Svendsen, M., Tirthapura, S.: Dense subgraph maintenance under streaming edge weight updates for real-time story identification. VLDB J. 23(2), 175\u2013199 (2014)","journal-title":"VLDB J."},{"issue":"5","key":"805_CR4","doi-asserted-by":"publisher","first-page":"454","DOI":"10.14778\/2140436.2140442","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and mapreduce. Proc. VLDB Endowm. 5(5), 454\u2013465 (2012)","journal-title":"Proc. VLDB Endowm."},{"key":"805_CR5","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an o (n $$1\/4$$) approximation for densest k-subgraph. In: STOC, pp. 201\u2013210. ACM (2010)","DOI":"10.1145\/1806689.1806719"},{"key":"805_CR6","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Henzinger, M., Nanongkai, D., Tsourakakis, C.: Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In: STOC, pp. 173\u2013182 (2015)","DOI":"10.1145\/2746539.2746592"},{"key":"805_CR7","doi-asserted-by":"publisher","unstructured":"Boob, D., Gao, Y., Peng, R., Sawlani, S., Tsourakakis, C., Wang, D., Wang, J.: Flowless: Extracting densest subgraphs without flow computations. In: Proceedings of The Web Conference 2020, WWW \u201920, pp. 573\u2013583. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3366423.3380140","DOI":"10.1145\/3366423.3380140"},{"key":"805_CR8","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: WSDM, pp. 95\u2013106. ACM (2008)","DOI":"10.1145\/1341531.1341547"},{"issue":"3","key":"805_CR9","doi-asserted-by":"publisher","first-page":"0360116","DOI":"10.1103\/PhysRevE.74.036116","volume":"74","author":"A Capocci","year":"2006","unstructured":"Capocci, A., Servedio, V.D., Colaiori, F., Buriol, L.S., Donato, D., Leonardi, S., Caldarelli, G.: Preferential attachment in the growth of social networks: the internet encyclopedia wikipedia. Phys Review E 74(3), 0360116 (2006)","journal-title":"Phys Review E"},{"key":"805_CR10","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 84\u201395. Springer (2000)","DOI":"10.1007\/3-540-44436-X_10"},{"key":"805_CR11","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"},{"issue":"4","key":"805_CR12","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.: Power-law distributions in empirical data. SIAM Rev. 51(4), 661\u2013703 (2009)","journal-title":"SIAM Rev."},{"key":"805_CR13","doi-asserted-by":"crossref","unstructured":"Danisch, M., Chan, T.H.H., Sozio, M.: Large scale density-friendly graph decomposition via convex programming. In: WWW, pp. 233\u2013242. International World Wide Web Conferences Steering Committee (2017)","DOI":"10.1145\/3038912.3052619"},{"key":"805_CR14","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"},{"issue":"11","key":"805_CR15","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., Lin, X.: Efficient algorithms for densest subgraph discovery. Proc. VLDB Endowm. 12(11), 1719\u20131732 (2019)","journal-title":"Proc. VLDB Endowm."},{"issue":"1\u20132","key":"805_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P., et al.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Q."},{"issue":"2","key":"805_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0378-8733(97)00016-6","volume":"20","author":"LC Freeman","year":"1998","unstructured":"Freeman, L.C., Webster, C.M., Kirke, D.M.: Exploring social structure using dynamic three-dimensional color images. Soc. Netw. 20(2), 109\u2013118 (1998)","journal-title":"Soc. Netw."},{"key":"805_CR18","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: PVLDB, pp. 721\u2013732. VLDB Endowment (2005)"},{"key":"805_CR19","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, pp. 2313\u20132314. ACM (2015)","DOI":"10.1145\/2783258.2789987"},{"key":"805_CR20","volume-title":"Finding a Maximum Density Subgraph","author":"AV Goldberg","year":"1984","unstructured":"Goldberg, A.V.: Finding a Maximum Density Subgraph. University of California Berkeley, CA (1984)"},{"key":"805_CR21","doi-asserted-by":"crossref","unstructured":"Han, X., Cheng, R., Grubenmann, T., Maniu, S., Ma, C., Li, X.: Leveraging contextual graphs for stochastic weight completion in sparse road networks. In: SIAM International Conference on Data Mining. SIAM (2022)","DOI":"10.1137\/1.9781611977172.8"},{"key":"805_CR22","doi-asserted-by":"crossref","unstructured":"Han, X., Cheng, R., Ma, C., Grubenmann, T.: Deeptea: Effective and efficient online time-dependent trajectory outlier detection. In: Proceedings of the VLDB Endowment (2022)","DOI":"10.14778\/3523210.3523225"},{"key":"805_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2021.100696","volume":"72","author":"X Han","year":"2022","unstructured":"Han, X., Dell\u2019Aglio, D., Grubenmann, T., Cheng, R., Bernstein, A.: A framework for differentially-private knowledge graph embeddings. J. Web Semant. 72, 100696 (2022)","journal-title":"J. Web Semant."},{"key":"805_CR24","doi-asserted-by":"crossref","unstructured":"Han, X., Grubenmann, T., Cheng, R., Wong, S.C., Li, X., Sun, W.: Traffic incident detection: A trajectory-based approach. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 1866\u20131869. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00190"},{"key":"805_CR25","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. ACM (2016)","DOI":"10.1145\/2939672.2939747"},{"key":"805_CR26","doi-asserted-by":"crossref","unstructured":"Hu, S., Wu, X., Chan, T.H.: Maintaining densest subsets efficiently in evolving hypergraphs. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 929\u2013938 (2017)","DOI":"10.1145\/3132847.3132907"},{"key":"805_CR27","unstructured":"Jaggi, M.: Revisiting frank-wolfe: Projection-free sparse convex optimization. In: Proceedings of the 30th International Conference on Machine Learning, CONF, pp. 427\u2013435 (2013)"},{"key":"805_CR28","doi-asserted-by":"crossref","unstructured":"Java, A., Song, X., Finin, T., Tseng, B.: Why we twitter: understanding microblogging usage and communities. In: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, pp. 56\u201365. ACM (2007)","DOI":"10.1145\/1348549.1348556"},{"key":"805_CR29","unstructured":"Kannan, R., Vinay, V.: Analyzing the structure of large graphs. Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn Bonn (1999)"},{"issue":"10","key":"805_CR30","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1038\/nrm2503","volume":"9","author":"G Karlebach","year":"2008","unstructured":"Karlebach, G., Shamir, R.: Modelling and analysis of gene regulatory networks. Nat. Rev. Mol. Cell Biol. 9(10), 770\u2013780 (2008)","journal-title":"Nat. Rev. Mol. Cell Biol."},{"key":"805_CR31","doi-asserted-by":"crossref","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: International Colloquium on Automata, Languages, and Programming, pp. 597\u2013608. Springer (2009)","DOI":"10.1007\/978-3-642-02927-1_50"},{"issue":"5","key":"805_CR32","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM (JACM) 46(5), 604\u2013632 (1999)","journal-title":"J. ACM (JACM)"},{"key":"805_CR33","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT \u2013 The Koblenz Network Collection. In: WWW, pp. 1343\u20131350 (2013). http:\/\/userpages.uni-koblenz.de\/~kunegis\/paper\/kunegis-koblenz-network-collection.pdf","DOI":"10.1145\/2487788.2488173"},{"key":"805_CR34","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L.V.: On a quest for combating filter bubbles and misinformation. In: Proceedings of the 2022 International Conference on Management of Data, pp. 2\u20132 (2022)","DOI":"10.1145\/3514221.3523275"},{"key":"805_CR35","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web 1(1) (2007)","DOI":"10.1145\/1232722.1232727"},{"issue":"6","key":"805_CR36","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.14778\/3447689.3447714","volume":"14","author":"X Li","year":"2021","unstructured":"Li, X., Cheng, R., Chang, K.C.C., Shan, C., Ma, C., Cao, H.: On analyzing graphs with motif-paths. Proc. VLDB Endowm. 14(6), 1111\u20131123 (2021)","journal-title":"Proc. VLDB Endowm."},{"key":"805_CR37","unstructured":"Luo, W., Ma, C., Fang, Y., Lakshmanan, L.V.S.: A survey of densest subgraph discovery on large graphs (2023)"},{"issue":"2","key":"805_CR38","doi-asserted-by":"publisher","first-page":"155","DOI":"10.14778\/3364324.3364330","volume":"13","author":"C Ma","year":"2019","unstructured":"Ma, C., Cheng, R., Lakshmanan, L.V., Grubenmann, T., Fang, Y., Li, X.: Linc: a motif counting algorithm for uncertain graphs. Proc. VLDB Endowm. 13(2), 155\u2013168 (2019)","journal-title":"Proc. VLDB Endowm."},{"issue":"11","key":"805_CR39","doi-asserted-by":"publisher","first-page":"2719","DOI":"10.14778\/3551793.3551826","volume":"15","author":"C Ma","year":"2022","unstructured":"Ma, C., Cheng, R., Lakshmanan, L.V., Han, X.: Finding locally densest subgraphs: a convex programming approach. Proc. VLDB Endowm. 15(11), 2719\u20132732 (2022)","journal-title":"Proc. VLDB Endowm."},{"key":"805_CR40","doi-asserted-by":"crossref","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V., 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, pp. 1051\u20131066 (2020)","DOI":"10.1145\/3318464.3389697"},{"issue":"1","key":"805_CR41","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/3471485.3471494","volume":"50","author":"C Ma","year":"2021","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V., Zhang, W., Lin, X.: Efficient directed densest subgraph discovery. ACM SIGMOD Rec. 50(1), 33\u201340 (2021)","journal-title":"ACM SIGMOD Rec."},{"issue":"4","key":"805_CR42","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., Zhang, W., Lin, X.: On directed densest subgraph discovery. TODS 46(4), 1\u201345 (2021)","journal-title":"TODS"},{"key":"805_CR43","doi-asserted-by":"crossref","unstructured":"Massa, P., Salvetti, M., Tomasoni, D.: Bowling alone and trust decline in social network sites. In: Proc. Int. Conf. Dependable, Autonomic and Secure Computing, pp. 658\u2013663 (2009)","DOI":"10.1109\/DASC.2009.130"},{"key":"805_CR44","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. ACM (2015)","DOI":"10.1145\/2783258.2783385"},{"key":"805_CR45","doi-asserted-by":"crossref","unstructured":"Mukherjee, A., Liu, B., Glance, N.: Spotting fake reviewer groups in consumer reviews. In: WWW, pp. 191\u2013200 (2012)","DOI":"10.1145\/2187836.2187863"},{"key":"805_CR46","doi-asserted-by":"crossref","unstructured":"Niu, X., Sun, X., Wang, H., Rong, S., Qi, G., Yu, Y.: Zhishi.me \u2013 weaving Chinese linking open data. In: Proc. Int. Semantic Web Conf., pp. 205\u2013220 (2011)","DOI":"10.1007\/978-3-642-25093-4_14"},{"key":"805_CR47","doi-asserted-by":"crossref","unstructured":"Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: generalizing degree and shortest paths. Soc. Netw. 3(32), 245\u2013251 (2010)","DOI":"10.1016\/j.socnet.2010.03.006"},{"key":"805_CR48","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in o (nm) time, or better. In: STOC, pp. 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"805_CR49","doi-asserted-by":"crossref","unstructured":"Prakash, B.A., Sridharan, A., Seshadri, M., Machiraju, S., Faloutsos, C.: Eigenspokes: Surprising patterns and scalable community chipping in large graphs. In: PAKDD, pp. 435\u2013448. Springer (2010)","DOI":"10.1007\/978-3-642-13672-6_42"},{"key":"805_CR50","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. ACM (2015)","DOI":"10.1145\/2783258.2783299"},{"key":"805_CR51","unstructured":"Rossi, R., Ahmed, N.: Network repository (2013). http:\/\/networkrepository.com"},{"key":"805_CR52","doi-asserted-by":"crossref","unstructured":"Sarma, A.D., Lall, A., Nanongkai, D., Trehan, A.: Dense subgraphs on dynamic networks. In: International Symposium on Distributed Computing, pp. 151\u2013165. Springer (2012)","DOI":"10.1007\/978-3-642-33651-5_11"},{"key":"805_CR53","doi-asserted-by":"crossref","unstructured":"Sawlani, S., Wang, J.: Near-optimal fully dynamic densest subgraph. In: STOC, pp. 181\u2013193 (2020)","DOI":"10.1145\/3357713.3384327"},{"issue":"2","key":"805_CR54","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":"805_CR55","doi-asserted-by":"crossref","unstructured":"Stratton, J.A., Anssari, N., Rodrigues, C., Sung, I.J., Obeid, N., Chang, L., Liu, G.D., Hwu, W.m.: Optimization and architecture effects on gpu computing workload performance. In: 2012 Innovative Parallel Computing (InPar), pp. 1\u201310. IEEE (2012)","DOI":"10.1109\/InPar.2012.6339605"},{"issue":"10","key":"805_CR56","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.14778\/3401960.3401962","volume":"13","author":"B Sun","year":"2020","unstructured":"Sun, B., Dansich, M., Chan, H., Sozio, M.: Kclist++: a simple algorithm for finding k-clique densest subgraphs in large graphs. Proc. VLDB Endowm. 13(10), 1628\u20131640 (2020)","journal-title":"Proc. VLDB Endowm."},{"key":"805_CR57","doi-asserted-by":"crossref","unstructured":"Tatti, N., Gionis, A.: Density-friendly graph decomposition. In: WWW, pp. 1089\u20131099. International World Wide Web Conferences Steering Committee (2015)","DOI":"10.1145\/2736277.2741119"},{"key":"805_CR58","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: The k-clique densest subgraph problem. In: WWW, pp. 1122\u20131132. International World Wide Web Conferences Steering Committee (2015)","DOI":"10.1145\/2736277.2741098"},{"issue":"2","key":"805_CR59","first-page":"1","volume":"1","author":"Y Xu","year":"2023","unstructured":"Xu, Y., Ma, C., Fang, Y., Bao, Z.: Efficient and effective algorithms for generalized densest subgraph discovery. Proc. ACM Manag. Data 1(2), 1\u201327 (2023)","journal-title":"Proc. ACM Manag. Data"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00805-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-023-00805-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00805-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T19:06:45Z","timestamp":1705604805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-023-00805-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,31]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["805"],"URL":"https:\/\/doi.org\/10.1007\/s00778-023-00805-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,31]]},"assertion":[{"value":"13 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}