Login / Signup
An approximate König's theorem for edge-coloring weighted bipartite graphs.
José R. Correa
Michel X. Goemans
Published in:
STOC (2004)
Keyphrases
</>
bipartite graph
edge weights
bipartite graph matching
weighted graph
maximum weight
graph model
maximum matching
link prediction
graph clustering
minimum weight
maximum cardinality
minimum spanning tree
bipartite networks
mutual reinforcement
data sets
search engine
information retrieval