Debmalya Panigrahi

most citedA Linear-time Algorithm for Sparsification of Unweighted Graphs

2 citations · 4 across the 3 of their papers we have counts for

collaborators

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 $G$ and an error parameter $ε > 0$ , the {\em graph sparsification} problem requires sampling edges in $G$ 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 $G$ and an error parameter $ε > 0$ , the {\em graph sparsification} problem requires sampling edges in $G$ and giving the sampled edges appropriate weights to…