Skip to main content
Conference Proceedings

An efficient Parallel algorithm for maximal matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 634 LNCS 813-814
DOI: 10.1007/3-540-55895-0_502
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a parallel algorithm for maximal matching of an undirected graph. The algorithm runs in O(log3n) time and uses O(m+n) processors on a EREW-PRAM, where m and n are the number of edges and vertices in the graph, respectively.

Cite

CITATION STYLE

APA

Datta, A. K., & Sen, R. K. (1992). An efficient Parallel algorithm for maximal matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 634 LNCS, pp. 813–814). Springer Verlag. https://doi.org/10.1007/3-540-55895-0_502

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free