A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Refined Vertex Sparsifiers of Planar Graphs
[article]

2019
*
arXiv
*
pre-print

We study the following version of cut sparsification. Given a large edge-weighted network G with k terminal vertices, compress it into a smaller network H with the same terminals, such that every minimum terminal cut in H approximates the corresponding one in G, up to a factor q≥ 1 that is called the quality. (The case q=1 is known also as a mimicking network). We provide new insights about the structure of minimum terminal cuts, leading to new results for cut sparsifiers of planar graphs. Our

arXiv:1702.05951v3
fatcat:e3ot4ry5sbg35nbvqt3qqbwpae