An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs (Q4015475)
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 86256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs |
scientific article; zbMATH DE number 86256 |
Statements
An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs (English)
0 references
5 January 1993
0 references
randomized algorithm
0 references
maximum-flow maximum-cut
0 references
connected random graphs
0 references
NP-hard communication problem
0 references
sublogarithmic parallel and distributed implementation
0 references
0.89282113
0 references
0.89067084
0 references
0.8863474
0 references
0.88164544
0 references
0.8760935
0 references
0.8752911
0 references
0.8743036
0 references
