Sublinear-Time Parallel Algorithms for Matching and Related Problems (Q4033764)
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: Sublinear-Time Parallel Algorithms for Matching and Related Problems |
scientific article; zbMATH DE number 166206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear-Time Parallel Algorithms for Matching and Related Problems |
scientific article; zbMATH DE number 166206 |
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
0.8511589169502258
0 references
0.8488984107971191
0 references
0.8475525379180908
0 references
0.8427742123603821
0 references
