activity
20242026
most citedA Survey of Densest Subgraph Discovery on Large Graphs

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing cs.DBShow all

1 paper · 1 filter

cs.DB2025

Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density

Yi Yang, Chenhao Ma, Reynold Cheng +2

Finding the densest subgraph (DS) from a graph is a fundamental problem in graph databases. The DS obtained, which reveals closely related entities, has been found to be useful in…