A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs.
Ariful AzadAydin BuluçAlex PothenPublished in: IPDPS (2015)
Keyphrases
- maximum cardinality
- bipartite graph
- maximum matching
- minimum weight
- maximum weight
- endpoints
- dynamic programming
- tree structure
- matching algorithm
- learning algorithm
- bipartite graph matching
- worst case
- np hard
- active learning
- spanning tree
- computational complexity
- knapsack problem
- graph theory
- probabilistic model
- optimal solution