2 papers
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…
cs.DB2024
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
Yingli Zhou, Qingshuo Guo, Yi Yang +3
As a fundamental topic in graph mining, Densest Subgraph Discovery (DSD) has found a wide spectrum of real applications. Several DSD algorithms, including exact and approximation a…