Sublinear-Time Parallel Algorithms for Matching and Related Problems (Q4033764)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sublinear-Time Parallel Algorithms for Matching and Related Problems |
scientific article |
Statements
Sublinear-Time Parallel Algorithms for Matching and Related Problems (English)
0 references
16 May 1993
0 references
sublinear-time deterministic parallel algorithms
0 references
bipartite matching
0 references
maximal node-disjoint paths
0 references
depth-first search
0 references
flows in zero-one networks
0 references
minimum-cost flow
0 references
