A survey that classifies existing densest subgraph discovery solutions into groups, reviews around 50 papers, compares models, and identifies future research directions.
Applied Network Science 6(1):1–17
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.SI 1years
2023 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A Survey of Densest Subgraph Discovery on Large Graphs
A survey that classifies existing densest subgraph discovery solutions into groups, reviews around 50 papers, compares models, and identifies future research directions.