Better Bounds for Incremental Frequency Allocation in Bipartite Graphs.

Marek Chrobak Lukasz Jez Jirí Sgall

Published in: ESA (2011)

Keyphrases

bipartite graph
maximum matching
minimum weight
upper bound
lower bound
worst case
link prediction
maximum cardinality
graph clustering
resource allocation
bipartite graph matching
edge weights
maximum weight
bipartite networks
mutual reinforcement
hits algorithm
random walk