Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ANDRÁS SALAMON:
All reports by Author András Salamon:

TR12-183 | 25th December 2012
András Salamon

Streaming bounds from difference ramification

Revisions: 1 , Comments: 1

In graph streaming a graph with $n$ vertices and $m$ edges is presented as a read-once stream of edges. We obtain an $\Omega(n \log n)$ lower bound on the space required to decide graph connectivity. This improves the known bounds of $\Omega(n)$ for undirected and $\Omega(m)$ for sparse directed graphs. ... more >>>




ISSN 1433-8092 | Imprint