Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs

We study vertex sparsification for preserving cuts. Given a graph G with a subset |T|=k of its vertices called terminals, a quality-q cut sparsifier is a graph G' that contains T, such that, for any partition (T₁, T₂) of T into non-empty subsets, the value of the min-cut in G' separating T₁ from T₂ is within factor q from the value of the min-cut in G separating T₁ from T₂. The construction of cut sparsifiers with good (small) quality and size has been a central problem in graph compression for years. Planar graphs and quasi-bipartite graphs are two important special families studied in this research direction. The main results in this paper are new cut sparsifier constructions for them in the high-quality regime (where q=1 or 1+ for small >0). We first show that every planar graph admits a planar quality- (1+) cut sparsifier of size O (k/poly () ), which is in sharp contrast with the lower bound of 2^ (k) for the quality-1 case. We then show that every quasi-bipartite graph admits a quality-1 cut sparsifier of size 2^ O (k²). This is the second to improve over the doubly-exponential bound for general graphs (previously only planar graphs have been shown to have single-exponential size quality-1 cut sparsifiers). Lastly, we show that contraction, a common approach for constructing cut sparsifiers adopted in most previous works, does not always give optimal bounds for cut sparsifiers. We demonstrate this by showing that the optimal size bound for quality- (1+) contraction-based cut sparsifiers for quasi-bipartite graphs lies in the range k^ (1/), k^O (1/²), while in previous work an upper bound of O (k/²) was achieved via a non-contraction approach.