Sciweavers

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

40

CORR
2010
Springer

favoriteEmaildiscussreport

176views Education» more CORR 2010»

A General Framework for Graph Sparsification

13 years 11 months ago

A General Framework for Graph Sparsification

Download people.csail.mit.edu

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 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

CORR 2010 | Education | Graph Sparsification | Graph Sparsification Problem | Weighted Graphs |

claim paper

Related Content

» A Sparsification Approach for Temporal Graphical Model Decomposition

» A general framework for types in graph rewriting

» Graph Embedding and Extensions A General Framework for Dimensionality Reduction

» A general state graph transformation framework for asynchronous synthesis

» Graph Embedding A General Framework for Dimensionality Reduction

» A general optimization framework for smoothing language models on graph structures

» HyperGraphDB A Generalized Graph Database

» A Framework for Adding Packages to Graph Transformation Approaches

» A general framework for adaptive processing of data structures

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)