Efficient Primal-Dual Graph Algorithms for MapReduce (Q2945274): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-13123-8_6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2126077878 / rank | |||
Normal rank | |||
Revision as of 22:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Primal-Dual Graph Algorithms for MapReduce |
scientific article |
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
