Vertex Sparsification for Edge Connectivity

Cited by: 0|Bibtex|Views18|Links

Abstract:

Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether $(1+\epsilon)$-approximate cut-preserving vertex sparsifiers with size close to the number of terminals exist. As a step towards this goal, we study a thresholded version of the problem: ...More

Code:

Data:

Your rating :
0

 

Tags
Comments