Better bounds for incremental frequency allocation in bipartite graphs.

Marek Chrobak Lukasz Jez Jirí Sgall

Published in: Theor. Comput. Sci. (2013)

Keyphrases

bipartite graph
maximum matching
upper bound
link prediction
lower bound
minimum weight
maximum cardinality
resource allocation
bipartite graph matching
maximum weight
objective function
machine learning
edge weights
bipartite networks
feature space
worst case