densesubgraph
Densesubgraph (often written as “dense subgraph”) refers to a subgraph with a high edge density relative to its size. In an undirected graph G=(V,E), a subgraph H=(V',E') with V'⊆V and E'⊆E is considered dense if the ratio of edges to vertices is large. Density is commonly defined as either |E'|/|V'| or as the average degree 2|E'|/|V'|; the two definitions differ by a constant factor.
The densest subgraph problem asks to find a nonempty subgraph that maximizes density. For undirected graphs,
Related variants include the densest k-subgraph problem (DkS), which seeks a subgraph with exactly k vertices
Applications of dense subgraph methods appear in social network analysis, bioinformatics, and data mining, where identifying