Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

CORR
2010
Springer

favoriteEmaildiscussreport

97views Education» more CORR 2010»

A Linear-time Algorithm for Sparsification of Unweighted Graphs

13 years 4 months ago

A Linear-time Algorithm for Sparsification of Unweighted Graphs

Download people.csail.mit.edu

Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a sparse graph G with the following property: the weight of every cut in G is within a factor of (1

Ramesh Hariharan, Debmalya Panigrahi

Real-time Traffic

Algorithms | CORR 2010 | Education | Graph Sparsification Problem | Undirected Graph |

claim paper

Related Content

» Linear Time Algorithms for Generalized Edge Dominating Set Problems

» Algorithms for the edgewidth of an embedded graph

» Outputsensitive algorithm for the edgewidth of an embedded graph

» Small Phylogeny Problem Character Evolution Trees

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Ramesh Hariharan, Debmalya Panigrahi

Comments (0)