A fast and simple randomized parallel algorithm for maximal matching (Q1073573): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q294682 |
||
| Property / author | |||
| Property / author: Alon Itai / rank | |||
Revision as of 12:55, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast and simple randomized parallel algorithm for maximal matching |
scientific article |
Statements
A fast and simple randomized parallel algorithm for maximal matching (English)
0 references
1986
0 references
A parallel randomized algorithm to find a maximal matching is presented. Its expected running time on a CRCW-PRAM with \(| E|\) processors in O(log\(| E|)\). The expected time is independent of the structure of the input graph. This improves the best known deterministic algorithm by a factor of \(\log^ 2| E|\).
0 references
parallel computation
0 references
parallel randomized algorithm
0 references
CRCW-PRAM
0 references
