Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
Constructing a perfect matching is in random NC
R. M. Karp
*
, E. Upfal
,
A. Wigderson
*
Corresponding author for this work
Research output
:
Contribution to journal
›
Article
›
peer-review
184
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Constructing a perfect matching is in random NC'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Perfect Matching
100%
Maximum Weight
66%
Edge Weight
66%
Unary
66%
Complexity Classes
33%
Directed Graph
33%
Parallel Algorithm
33%
Maximum Cardinality Matching
33%
Vertex Weight
33%
Mathematics
Perfect Matchings
100%
Edge
66%
Polynomial
33%
Cardinality
33%
Bounded Number
33%
Computer Science
Perfect Matchings
100%
Complexity Class
33%
Cardinality
33%
Directed Graphs
33%
Parallel Algorithm
33%