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

Syamantak Das Nikhil Kumar Daniel Vaz

Published in: MFCS (2024)

Keyphrases

tight bounds
bipartite graph
upper bound
maximum matching
link prediction
minimum weight
graph model
bipartite graph matching
maximum cardinality
query processing
graph clustering
maximum weight
learning algorithm
lower bound
random walk