In search of dense subgraphs: How good is greedy peeling? (Q6087137): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/net.22034 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.22034 / rank | |||
Normal rank | |||
Latest revision as of 18:19, 30 December 2024
scientific article; zbMATH DE number 7775310
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
