{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:05:32Z","timestamp":1775815532677,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,10,20]],"date-time":"2013-10-20T00:00:00Z","timestamp":1382227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00778-013-0340-z","type":"journal-article","created":{"date-parts":[[2013,10,19]],"date-time":"2013-10-19T05:41:50Z","timestamp":1382161310000},"page":"175-199","source":"Crossref","is-referenced-by-count":43,"title":["Dense subgraph maintenance under streaming edge weight updates for real-time story identification"],"prefix":"10.1007","volume":"23","author":[{"given":"Albert","family":"Angel","sequence":"first","affiliation":[]},{"given":"Nick","family":"Koudas","sequence":"additional","affiliation":[]},{"given":"Nikos","family":"Sarkas","sequence":"additional","affiliation":[]},{"given":"Divesh","family":"Srivastava","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Svendsen","sequence":"additional","affiliation":[]},{"given":"Srikanta","family":"Tirthapura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,20]]},"reference":[{"key":"340_CR1","doi-asserted-by":"crossref","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Proceedings of the 5th Latin American Symposium on Theoretical Informatics, pp. 598\u2013612 (2002)","DOI":"10.1007\/3-540-45995-2_51"},{"key":"340_CR2","doi-asserted-by":"crossref","unstructured":"Angel, A., Koudas, N.: Efficient diversity-aware search. In: SIGMOD Conference, pp. 781\u2013792 (2011)","DOI":"10.1145\/1989323.1989405"},{"key":"340_CR3","doi-asserted-by":"crossref","unstructured":"Angel, A., Koudas, N., Sarkas, N., Srivastava, D.: What\u2019s on the grapevine? In: Proceedings of the SIGMOD Conference, pp. 1047\u20131050 (2009)","DOI":"10.1145\/1559845.1559977"},{"issue":"6","key":"340_CR4","doi-asserted-by":"crossref","first-page":"574","DOI":"10.14778\/2168651.2168658","volume":"5","author":"A Angel","year":"2012","unstructured":"Angel, A., Sarkas, N., Koudas, N., Srivastava, D.: Dense subgraph maintenance under streaming edge weight updates for real-time story identification. Proc. VLDB 5(6), 574\u2013585 (2012)","journal-title":"Proc. VLDB"},{"key":"340_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chiang, F., Koudas, N., Tompa, F.W.: Seeking stable clusters in the blogosphere. In: Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB), pp. 806\u2013817 (2007)","DOI":"10.1145\/1242572.1242802"},{"key":"340_CR6","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 623\u2013632 (2002)"},{"key":"340_CR7","doi-asserted-by":"crossref","unstructured":"Blei, D.M., Griffiths, T.L., Jordan, M.I.: The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies. J. ACM 57(2), 7:1\u20137:30 (2010)","DOI":"10.1145\/1667053.1667056"},{"key":"340_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Kumar, R., Tomkins, A.: Evolutionary clustering. In: Proceedings of the ACM KDD Conference, pp. 554\u2013560 (2006)","DOI":"10.1145\/1150402.1150467"},{"key":"340_CR9","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 626\u2013635 (1997)","DOI":"10.1145\/258533.258657"},{"key":"340_CR10","doi-asserted-by":"crossref","unstructured":"Cortes, C., Pregibon, D., Volinsky, C.: Computational methods for dynamic graphs. J. Comput. Graph. Stat. (2003)","DOI":"10.1198\/1061860032742"},{"key":"340_CR11","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic graph algorithms. In: Atallah, M.J. (ed.) Algorithms and Theory of Computation Handbook, chap. 8. CRC Press (1999). URL: http:\/\/www.info.uniroma2.it\/~italiano\/Papers\/dyn-survey.ps.Z"},{"key":"340_CR12","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Wimmer, M., Xu, X.: Incremental clustering for mining in a data warehousing environment. In: Proceedings of the 24rd International Conference on Very Large Data, Bases, pp. 323\u2013333 (1998)"},{"key":"340_CR13","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150\u2013160 (2000)","DOI":"10.1145\/347090.347121"},{"key":"340_CR14","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: Proceedings of the 31st International Conference on Very Large Data Bases (VLDB), pp. 721\u2013732 (2005)"},{"key":"340_CR15","unstructured":"Goldberg, A.: Finding a maximum density subgraph. Technical report, University of California at Berkeley (1984). URL: http:\/\/nma.berkeley.edu\/ark:\/28722\/bk000570k8g"},{"key":"340_CR16","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TKDE.2003.1198387","volume":"15","author":"S Guha","year":"2003","unstructured":"Guha, S., Meyerson, A., Mishra, N., Motwani, R., O\u2019Callaghan, L.: Clustering data streams: theory and practice. IEEE Trans. Knowl. Data Eng. 15, 515\u2013528 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"340_CR17","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"340_CR18","doi-asserted-by":"crossref","unstructured":"Hartline, J., Sharp, A.: An incremental model for combinatorial maximization problems. In: Proceedings of the 5th International Workshop on Experimental Algorithms, pp. 36\u201348 (2006)","DOI":"10.1007\/11764298_4"},{"issue":"1","key":"340_CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/net.20168","volume":"50","author":"J Hartline","year":"2007","unstructured":"Hartline, J., Sharp, A.: Incremental flow. Networks 50(1), 77\u201385 (2007)","journal-title":"Networks"},{"issue":"3","key":"340_CR20","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1198\/106186006X139162","volume":"15","author":"S Hill","year":"2006","unstructured":"Hill, S., Agarwal, D.K., Bell, R., Volinsky, C.: Building an effective representation for dynamic networks. J. Comput. Graph. Stat. 15(3), 584\u2013608 (2006)","journal-title":"J. Comput. Graph. Stat."},{"key":"340_CR21","doi-asserted-by":"crossref","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP), pp. 597\u2013608 (2009)","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"340_CR22","doi-asserted-by":"crossref","unstructured":"Kim, M.S., Han, J.: Chronicle: a two-stage density-based clustering algorithm for dynamic networks. In: Discovery Science, pp. 152\u2013167 (2009)","DOI":"10.1007\/978-3-642-04747-3_14"},{"issue":"1","key":"340_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1023607406540","volume":"2","author":"S Kumar","year":"2003","unstructured":"Kumar, S., Gupta, P.: An incremental algorithm for the maximum flow problem. J. Math. Model. Algorithm. 2(1), 1\u201316 (2003)","journal-title":"J. Math. Model. Algorithm."},{"issue":"7","key":"340_CR24","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"EL Lawler","year":"1972","unstructured":"Lawler, E.L.: A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manag. Sci. 18(7), 401\u2013405 (1972)","journal-title":"Manag. Sci."},{"key":"340_CR25","doi-asserted-by":"crossref","unstructured":"Long, J., Hartman, C.: ODES: an overlapping dense sub-graph algorithm. Bioinformatics 26(21), 2788\u20132789 (2010)","DOI":"10.1093\/bioinformatics\/btq514"},{"key":"340_CR26","doi-asserted-by":"crossref","unstructured":"Mathioudakis, M., Koudas, N.: Twittermonitor: trend detection over the twitter stream. In: SIGMOD Conference, pp. 1155\u20131158 (2010)","DOI":"10.1145\/1807167.1807306"},{"key":"340_CR27","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. J. Glob. Optim. 4, 301\u2013328 (1994)","journal-title":"J. Glob. Optim."},{"key":"340_CR28","doi-asserted-by":"crossref","unstructured":"Sarkas, N., Angel, A., Koudas, N., Srivastava, D.: Efficient identification of coupled entities in document collections. In: Proceedings of ICDE Conference, pp. 769\u2013772 (2010)","DOI":"10.1109\/ICDE.2010.5447820"},{"key":"340_CR29","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/B:COAP.0000008651.28952.b6","volume":"27","author":"V Stix","year":"2004","unstructured":"Stix, V.: Finding all maximal cliques in dynamic graphs. Comput. Optim. Appl. 27, 173\u2013186 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"340_CR30","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00453-008-9238-3","volume":"56","author":"T Uno","year":"2010","unstructured":"Uno, T.: An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica 56, 3\u201316 (2010)","journal-title":"Algorithmica"},{"key":"340_CR31","doi-asserted-by":"crossref","unstructured":"Wang, N., Parthasarathy, S., Tan, K.L., Tung, A.K.H.: Csv: visualizing and mining cohesive subgraphs. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 445\u2013458 (2008)","DOI":"10.1145\/1376616.1376663"},{"key":"340_CR32","doi-asserted-by":"crossref","unstructured":"Yang, D., Rundensteiner, E.A., Ward, M.O.: Neighbor-based pattern detection for windows over streaming data. In: Proceedings of the EDBT Conference, pp. 529\u2013540 (2009)","DOI":"10.1145\/1516360.1516422"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-013-0340-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-013-0340-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-013-0340-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T12:18:08Z","timestamp":1688559488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-013-0340-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,20]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["340"],"URL":"https:\/\/doi.org\/10.1007\/s00778-013-0340-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,20]]}}}