Graph sparsification by edge connectivity and random spanning ...
Graph Sparsifiers byEdge-Connectivity andRandom Spanning Trees. Nick Harvey University of WaterlooDepartment of Combinatorics and Optimization. Joint work with Isaac Fung. ... Construct H by sampling every edge of Gwith probp=100 log n/n. Give each edge .