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

1 Citation (Scopus)

Abstract

The authors present simple randomized parallel algorithms for finding a maximal matching in a unidirectional graph G = (V, E) for the CRCW and CREW models. The algorithm for the CRCW model has O(log m) expected running time using m processors, where m is the number of edges in G. It is also shown that the CRCW algorithm can be implemented on a CREW PRAM (parallel random access machine). The CREW algorithm runs in O(log2 m) time, but it requires only m/log m processors.

Original languageEnglish
Title of host publicationConference Proceedings - IEEE SOUTHEASTCON
PublisherPubl by IEEE
Pages579-581
Number of pages3
ISBN (Print)0780300335
Publication statusPublished - 1991 Jan 1
EventIEEE Proceedings of the SOUTHEASTCON '91 - Williamsburg, VA, USA
Duration: 1991 Apr 81991 Apr 10

Publication series

NameConference Proceedings - IEEE SOUTHEASTCON
Volume1
ISSN (Print)0734-7502

Other

OtherIEEE Proceedings of the SOUTHEASTCON '91
CityWilliamsburg, VA, USA
Period91/4/891/4/10

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Yang, S. B., Dhall, S. K., & Lakshmivarahan, S. (1991). Simple randomized parallel algorithms for finding a maximal matching in an undirected graph. In Conference Proceedings - IEEE SOUTHEASTCON (pp. 579-581). (Conference Proceedings - IEEE SOUTHEASTCON; Vol. 1). Publ by IEEE.