Finding connected \(k\)-subgraphs with high density (Q2407097): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Finding dense subgraphs / rank | |||
Normal rank | |||
Latest revision as of 10:43, 4 December 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
0 references
0 references
