Algorithms for Densest Subgraphs of Vertex-Weighted Graphs
Finding the densest subgraph has tremendous potential in computer vision and social network research, among other domains. In computer vision, it can demonstrate essential structures, and in social network research, it aids in identifying closely associated communities. The densest subgraph problem...
| Published in: | Mathematics |
|---|---|
| Main Authors: | , , , , |
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-07-01
|
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/12/14/2206 |