Complexity of finding dense subgraphs (Q1613384)
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 1792330
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of finding dense subgraphs |
scientific article; zbMATH DE number 1792330 |
Statements
Complexity of finding dense subgraphs (English)
0 references
29 August 2002
0 references
regular graph
0 references
dense subgraph problem
0 references
0.9236112236976624
0 references
0.8544771075248718
0 references
0.8288414478302002
0 references
0.8276840448379517
0 references
