Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Press/Media
Datasets
Activities
Fellowships, Honors, and Prizes
Search by expertise, name or affiliation
Greedy Matching in Bipartite Random Graphs
Nick Arnosti
Industrial and Systems Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Greedy Matching in Bipartite Random Graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Random Graphs
67%
Bipartite Graph
64%
Vertex of a graph
40%
Performance
14%
Many to one
11%
Matching Algorithm
10%
Greedy Algorithm
8%
Finite Graph
7%
Lowest
7%
Approximation
3%
Business & Economics
Random Graphs
100%
Guarantee
18%
Bipartite Graph
17%
Performance
13%
Graph
11%
Approximation
9%
Engineering & Materials Science
Set theory
9%