共 35 条
[1]
[Anonymous], 2013, P 7 ACM C RECOMMENDE
[2]
Densest Subgraph in Streaming and MapReduce
[J].
PROCEEDINGS OF THE VLDB ENDOWMENT,
2012, 5 (05)
:454-465
[3]
Ban YK, 2018, Arxiv, DOI arXiv:1805.10053
[4]
Beutel A., 2013, P 22 INT C WORLD WID, P119
[5]
Flowless: Extracting Densest Subgraphs Without Flow Computations
[J].
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020),
2020,
:573-583
[6]
Charikar M., 2000, Approximation Algorithms for Combinatorial Optimization. Third International Workshop, APPROX 2000. Proceedings (Lecture Notes in Computer Science Vol.1913), P84
[7]
Chekuri C, 2022, PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, P1531
[10]
Distil Networks, 2019 BAD BOT REP