A fast and simple randomized parallel algorithm for maximal matching (Q1073573)
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 3945362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast and simple randomized parallel algorithm for maximal matching |
scientific article; zbMATH DE number 3945362 |
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
0.9279818534851074
0 references
0.9200050830841064
0 references
0.9186559915542604
0 references
0.8847417235374451
0 references
