Sciweavers

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

172

SIGMOD
2008
ACM

116views Database» more SIGMOD 2008»

Graph summarization with bounded error

16 years 3 months ago

Graph summarization with bounded error

Download www.cs.umd.edu

Saket Navlakha, Rajeev Rastogi, Nisheeth Shrivasta

Real-time Traffic

Database | Graph Summarization | SIGMOD 2008 |

claim paper

Related Content

» Tight results for clustering and summarizing data streams

» pCube UpdateEfficient Online Aggregation with Progressive Feedback and Error Bounds

» Fingerprinting bounding softerror detection latency and bandwidth

» Spaceoptimal heavy hitters with strong error bounds

» Ggraphs for the cage problem a new upper bound

» Error bounds for correlation clustering

» A Lower Bound for Testing 3Colorability in BoundedDegree Graphs

» Spatiotemporal summarization of traffic data streams

» Planarity Allowing Few Error Vertices in Linear Time

Post Info
More Details (n/a)

Added	08 Dec 2009
Updated	08 Dec 2009
Type	Conference
Year	2008
Where	SIGMOD
Authors	Saket Navlakha, Rajeev Rastogi, Nisheeth Shrivastava

Comments (0)