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:
Algorithmica (2022)
Keyphrases
</>
maximum weight
bipartite graph
maximum cardinality
minimum weight
bipartite matching
worst case
bipartite graph matching
learning algorithm
maximum matching
social networks
data structure
computational complexity
markov chain
combinatorial optimization
link prediction
independent set