Technical Report CS0335

Title: A Fast and Simple Randomized Parallel Algorithm for Maximal Matching
Authors: A. Israeli and A. Itai
Abstract: A parallel randomized algorithm to find a maximal matching is presented. Its expected running time on a CRC-PRAM with |E| processors is 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|E|)^2.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1984
To the main CS technical reports page

Computer science department, Technion