<i>o</i>(log<sup>4</sup> <i>n</i>) time parallel maximal matching algorithm using linear number of processors (Q4826117)
From MaRDI portal
scientific article; zbMATH DE number 2114421
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | <i>o</i>(log<sup>4</sup> <i>n</i>) time parallel maximal matching algorithm using linear number of processors |
scientific article; zbMATH DE number 2114421 |
Statements
<i>o</i>(log<sup>4</sup> <i>n</i>) time parallel maximal matching algorithm using linear number of processors (English)
0 references
11 November 2004
0 references
Parallel Graph Algorithms
0 references
Matching
0 references
Vertex Cover
0 references
Parallel Random Access Machines
0 references
