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
.
Improved Guarantees for Vertex Sparsification in Planar Graphs
[article]
2017
arXiv
pre-print
Graph Sparsification aims at compressing large graphs into smaller ones while preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. We focus on the following notions: (1) Given a digraph G=(V,E) and terminal vertices K ⊂ V with |K| = k, a (vertex) reachability sparsifier of G is a digraph H=(V_H,E_H), K ⊂ V_H that preserves all reachability information among terminal pairs. In this
arXiv:1702.01136v1
fatcat:pghxyimrvfgptl7vgq5ubynyai