Superlinear lower bounds for multipass graph processing (Q343847)
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 6657215
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Superlinear lower bounds for multipass graph processing |
scientific article; zbMATH DE number 6657215 |
Statements
Superlinear lower bounds for multipass graph processing (English)
0 references
29 November 2016
0 references
streaming
0 references
maximum matching
0 references
shortest path
0 references
communication complexity
0 references
information theory
0 references
0 references
0 references
0 references
0 references
0.8132340908050537
0 references
0.7725561261177063
0 references
0.7668079137802124
0 references
0.7637724876403809
0 references
0.7618335485458374
0 references
