Author:
Yao Kai,Yang Xin,Chang Lijun
Publisher
Springer Nature Switzerland
Reference19 articles.
1. Malliaros, F.D., Vazirgiannis, M.: Clustering and community detection in directed networks: a survey. Phys. Rep. 533(4), 95–142 (2013)
2. Kannan, R., Vinay, V.: Analyzing the structure of large graphs. Universität Bonn. Institut für Ökonometrie und Operations Research (1999)
3. Lecture Notes in Computer Science;S Khuller,2009
4. Yang, J., McAuley, J., Leskovec, J.: Detecting cohesive and 2-mode communities indirected and undirected networks. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, pp. 323–332 (2014)
5. Sawlani, S., Wang, J.: Near-optimal fully dynamic densest subgraph. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 181–193 (2020)