CORR
2010
Springer
13 years 11 months ago
2010
Springer
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 obtai...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Given a weighted 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...