Simple randomized parallel algorithms for finding a maximal matching in an undirected graph

S. B. Yang, S. K. Dhall, S. Lakshmivarahan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Fingerprint

Dive into the research topics of 'Simple randomized parallel algorithms for finding a maximal matching in an undirected graph'. Together they form a unique fingerprint.

Computer Science

Mathematics