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...
I tiakina i:
| Ngā kaituhi matua: | , , , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
MDPI AG
2024-07-01
|
| Rangatū: | Mathematics |
| Ngā marau: | |
| Urunga tuihono: | https://www.mdpi.com/2227-7390/12/14/2206 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|