Efficient primal-dual graph algorithms for MapReduce (Q2945274)
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: Efficient primal-dual graph algorithms for MapReduce |
scientific article; zbMATH DE number 6480008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient primal-dual graph algorithms for MapReduce |
scientific article; zbMATH DE number 6480008 |
Statements
Efficient Primal-Dual Graph Algorithms for MapReduce (English)
0 references
9 September 2015
0 references
densest subgraph problem
0 references
MapReduce
0 references
fractional maximum matching problem in bipartite graphs
0 references
0 references
0 references
0 references
0 references
0.7547375559806824
0 references
0.75226229429245
0 references
0.7450764775276184
0 references
0.7433969378471375
0 references
