Greedily Finding a Dense Subgraph (Q4943076)
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: Greedily Finding a Dense Subgraph |
scientific article; zbMATH DE number 1415600
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedily Finding a Dense Subgraph |
scientific article; zbMATH DE number 1415600 |
Statements
Greedily Finding a Dense Subgraph (English)
0 references
28 August 2000
0 references
\(n\)-vertex graph
0 references
greedy algorithm
0 references
0.9893403053283693
0 references
0.8303491473197937
0 references
0.8288741111755371
0 references
