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
Volume1
ISBN (Print)0780300335
Publication statusPublished - 1991 Jan 1
EventIEEE Proceedings of the SOUTHEASTCON '91 - Williamsburg, VA, USA
Duration: 1991 Apr 81991 Apr 10

Other

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

Fingerprint

Parallel algorithms

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 (Vol. 1, pp. 579-581). Publ by IEEE.
Yang, S. B. ; Dhall, S. K. ; Lakshmivarahan, S. / Simple randomized parallel algorithms for finding a maximal matching in an undirected graph. Conference Proceedings - IEEE SOUTHEASTCON. Vol. 1 Publ by IEEE, 1991. pp. 579-581
@inproceedings{6b17315dc5a748fb9cc243c4b7c8424e,
title = "Simple randomized parallel algorithms for finding a maximal matching in an undirected graph",
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.",
author = "Yang, {S. B.} and Dhall, {S. K.} and S. Lakshmivarahan",
year = "1991",
month = "1",
day = "1",
language = "English",
isbn = "0780300335",
volume = "1",
pages = "579--581",
booktitle = "Conference Proceedings - IEEE SOUTHEASTCON",
publisher = "Publ by IEEE",

}

Yang, SB, Dhall, SK & Lakshmivarahan, S 1991, Simple randomized parallel algorithms for finding a maximal matching in an undirected graph. in Conference Proceedings - IEEE SOUTHEASTCON. vol. 1, Publ by IEEE, pp. 579-581, IEEE Proceedings of the SOUTHEASTCON '91, Williamsburg, VA, USA, 91/4/8.

Simple randomized parallel algorithms for finding a maximal matching in an undirected graph. / Yang, S. B.; Dhall, S. K.; Lakshmivarahan, S.

Conference Proceedings - IEEE SOUTHEASTCON. Vol. 1 Publ by IEEE, 1991. p. 579-581.

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

TY - GEN

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

AU - Yang, S. B.

AU - Dhall, S. K.

AU - Lakshmivarahan, S.

PY - 1991/1/1

Y1 - 1991/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025798262&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025798262&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025798262

SN - 0780300335

VL - 1

SP - 579

EP - 581

BT - Conference Proceedings - IEEE SOUTHEASTCON

PB - Publ by IEEE

ER -

Yang SB, Dhall SK, Lakshmivarahan S. Simple randomized parallel algorithms for finding a maximal matching in an undirected graph. In Conference Proceedings - IEEE SOUTHEASTCON. Vol. 1. Publ by IEEE. 1991. p. 579-581