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…