Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs.

Syamantak Das Nikhil Kumar Daniel Vaz

Published in: CoRR (2024)

Keyphrases

bipartite graph
tight bounds
upper bound
maximum matching
link prediction
graph model
minimum weight
maximum weight
graph clustering
maximum cardinality
bipartite graph matching
learning process
lower bound
web documents
edge weights
mutual reinforcement