Finding Connected Dense $$k$$-Subgraphs (Q2948471): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 09:06, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Connected Dense $$k$$-Subgraphs |
scientific article |
Statements
Finding Connected Dense $$k$$-Subgraphs (English)
0 references
30 September 2015
0 references
densest \(k\)-subgraphs
0 references
connectivity
0 references
combinatorial approximation algorithms
0 references
