Finding connected \(k\)-subgraphs with high density (Q2407097): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:12, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding connected \(k\)-subgraphs with high density |
scientific article |
Statements
Finding connected \(k\)-subgraphs with high density (English)
0 references
28 September 2017
0 references
densest \(k\)-subgraphs
0 references
heaviest \(k\)-subgraphs
0 references
connectivity
0 references
approximation algorithms
0 references
interval graphs
0 references
