In search of dense subgraphs: How good is greedy peeling? (Q6087137)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7775310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | In search of dense subgraphs: How good is greedy peeling? |
scientific article; zbMATH DE number 7775310 |
Statements
In search of dense subgraphs: How good is greedy peeling? (English)
0 references
11 December 2023
0 references
approximation
0 references
computational experiments
0 references
dense subgraphs
0 references
exact algorithms
0 references
heuristic algorithms
0 references
network optimization
0 references
worst-case analysis
0 references
0 references
0.811943531036377
0 references
0.7767763733863831
0 references
0.7741453051567078
0 references
0.7635623216629028
0 references
0.7621769905090332
0 references
