Author:
Semertzidis Konstantinos,Pitoura Evaggelia,Terzi Evimaria,Tsaparas Panayiotis
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference34 articles.
1. Alvarez-Hamelin JI, Dall’Asta L, Barrat A, Vespignani A (2005) Large scale networks fingerprinting and visualization using the k-core decomposition. In: Advances in neural information processing systems, [neural information processing systems, NIPS 2005, December 5–8, 2005, Vancouver, British Columbia, Canada], 2005, vol 18. MIT Press Cambridge, MA, USA, pp 41–50
2. Araujo M, Günnemann S, Papadimitriou S, Faloutsos C, Basu P, Swami A, Papalexakis EE, Koutra D (2016) Discovery of “comet” communities in temporal and labeled graphs com
$$^{2}$$
2
. Knowl Inf Syst 46(3):657–677.
https://doi.org/10.1007/s10115-015-0847-2
3. Asahiro Y, Iwama K, Tamaki H, Tokuyama T (2000) Greedily finding a dense subgraph. J Algorithms 34:203–221.
https://doi.org/10.1006/jagm.1999.1062
4. Bahmani B, Kumar R, Vassilvitskii S (2012) Densest subgraph in streaming and mapreduce. PVLDB 5(5):454–465.
https://doi.org/10.14778/2140436.2140442
5. Bhattacharya S, Henzinger M, Nanongkai D, Tsourakakis CE (2015) Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In: Proceedings of the forty-seventh annual ACM on symposium on theory of computing, STOC 2015, Portland, OR, USA, June 14–17, 2015, pp 173–182.
https://doi.org/10.1145/2746539.2746592
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finding conserved low‐diameter subgraphs in social and biological networks;Networks;2024-08-29
2. Scalable Temporal Motif Densest Subnetwork Discovery;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
3. Jaccard-constrained dense subgraph discovery;Machine Learning;2024-07-23
4. Fast Multilayer Core Decomposition and Indexing;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
5. Finding Dense and Persistently Expansive Subgraphs;Companion Proceedings of the ACM Web Conference 2024;2024-05-13