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

Syamantak Das, Nikhil Kumar, Daniel Vaz

Flow sparsification is a classic graph compression technique which, given a capacitated graph $G$ on $k$ terminals, aims to construct another capacitated graph $H$, called a flow s…