The densest subgraph problem with a convex/concave size function (Q1799206)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The densest subgraph problem with a convex/concave size function |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The densest subgraph problem with a convex/concave size function |
scientific article |
Statements
The densest subgraph problem with a convex/concave size function (English)
0 references
18 October 2018
0 references
graphs
0 references
dense subgraph extraction
0 references
densest subgraph problem
0 references
approximation algorithms
0 references
0 references
0.9830761551856996
0 references
0.8139593005180359
0 references
0.8025724291801453
0 references
0.7978934049606323
0 references
0.7965861558914185
0 references
