Login / Signup
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs.
Boris Klemz
Günter Rote
Published in:
CoRR (2017)
Keyphrases
</>
maximum weight
bipartite graph
maximum cardinality
minimum weight
bipartite matching
maximum matching
worst case
weighted graph
learning algorithm
training data
computational complexity
optimization problems
link prediction
greedy heuristic