A Deterministic Parallel Algorithm for Bipartite Perfect Matching.
A fundamental quest in the theory of computing is to understand the power of randomness. It is not known whether every problem with an efficient randomized algorithm also has one that does not use randomness. One of the extensively studied problems under this theme is that of perfect matching. The p...
| Publicado en: | Communications of the ACM Vol. 62; no. 3; pp. 109 - 116 |
|---|---|
| Autores principales: | , , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Mar2019
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |