An O(n^3) time algorithm for the maximum weight b-matching problem on bipartite graphs.
Fatemeh Rajabi-AlniAlireza BagheriBehrouz Minaei-BidgoliPublished in: CoRR (2014)
Keyphrases
- maximum weight
- bipartite graph
- maximum cardinality
- maximum matching
- bipartite graph matching
- bipartite matching
- minimum weight
- matching algorithm
- maximum weight matching
- learning algorithm
- dynamic programming
- np hard
- search space
- worst case
- weighted graph
- segmentation algorithm
- spanning tree
- minimum spanning tree
- query processing
- tree matching
- computational complexity
- optimal solution
- objective function