Lower bounds for testing digraph connectivity with one-pass streaming algorithms

Glencora Borradaile; Claire Mathieu; Theresa Migler

Lower bounds for testing digraph connectivity with one-pass streaming algorithms

Data Structures and Algorithms 2014-04-09 v2 Computational Complexity

Authors: Glencora Borradaile , Claire Mathieu , Theresa Migler

Abstract

In this note, we show that three graph properties - strong connectivity, acyclicity, and reachability from a vertex $s$ to all vertices - each require a working memory of $\Omega (\epsilon m)$ on a graph with $m$ edges to be determined correctly with probability greater than $(1+\epsilon)/2$ .

Keywords

graph theory graph spanners graph algorithms

Cite

@article{arxiv.1404.1323,
  title  = {Lower bounds for testing digraph connectivity with one-pass streaming algorithms},
  author = {Glencora Borradaile and Claire Mathieu and Theresa Migler},
  journal= {arXiv preprint arXiv:1404.1323},
  year   = {2014}
}

Comments

Added some references to previous work, removed the part of the result that was already known before, and changed the label of the result from "Theorem" to "Lemma"

Lower bounds for testing digraph connectivity with one-pass streaming algorithms

Abstract

Keywords

Cite

Comments

Related papers