2 citations · 5 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2010★ 2 cited
A Linear-time Algorithm for Sparsification of Unweighted Graphs
Ramesh Hariharan, Debmalya Panigrahi
Given an undirected graph and an error parameter , the {\em graph sparsification} problem requires sampling edges in and giving the sampled edges appropriate weights…
cs.DS2010★ 2 cited
A General Framework for Graph Sparsification
Ramesh Hariharan, Debmalya Panigrahi
Given a weighted graph and an error parameter , the {\em graph sparsification} problem requires sampling edges in and giving the sampled edges appropriate weights to…