Practical parallel algorithms for near-optimal densest subgraphs on massive graphs (Q6545384)
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: Practical parallel algorithms for near-optimal densest subgraphs on massive graphs |
scientific article; zbMATH DE number 7854936
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Practical parallel algorithms for near-optimal densest subgraphs on massive graphs |
scientific article; zbMATH DE number 7854936 |
Statements
Practical parallel algorithms for near-optimal densest subgraphs on massive graphs (English)
0 references
29 May 2024
0 references
0.7871965765953064
0 references
0.7864875793457031
0 references
0.7728428840637207
0 references
0.7696036100387573
0 references
