Constructing a perfect matching is in random NC

R. M. Karp*, E. Upfal, A. Wigderson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

178 Scopus citations

Abstract

We show that the problem of constructing a perfect matching in a graph is in the complexity class Random NC; i.e., the problem is solvable in polylog time by a randomized parallel algorithm using a polynomial-bounded number of processors. We also show that several related problems lie in Random NC. These include: (i) Constructing a perfect matching of maximum weight in a graph whose edge weights are given in unary notation; (ii) Constructing a maximum-cardinality matching; (iii) Constructing a matching covering a set of vertices of maximum weight in a graph whose vertex weights are given in binary; (iv) Constructing a maximum s-t flow in a directed graph whose edge weights are given in unary.

Original languageEnglish
Pages (from-to)35-48
Number of pages14
JournalCombinatorica
Volume6
Issue number1
DOIs
StatePublished - Mar 1986
Externally publishedYes

Keywords

  • AMS subject classification (1980): 68E10

Fingerprint

Dive into the research topics of 'Constructing a perfect matching is in random NC'. Together they form a unique fingerprint.

Cite this