AnswerBun.com

Semi-streaming algorithm for $s$-$t$ connectivity

Computer Science Asked by KaliTheGreat on November 30, 2020

Let $G=(V,E)$ be an undirected graph. Given a pair of vertices $s,t in V$, how can we construct a semi-streaming algorithm which determines is $s$ and $t$ are connected? Is there any way to construct such an algorithm which scans the input stream only once?

Note that a semi-streaming algorithm is presented an arbitrary order of the edges of $G$ as a stream, and the algorithm can only access this input sequentially in the order it is given; it might process the input stream several times. The algorithm has a working memory consisting of $O(nlog^{O(1)}n)$ bits.

One Answer

You cannot do it in a single pass. Consider the set of all graphs of the following form: the vertices are ${s,t} cup A cup B$, where $|A|=|B|=n/2-1$. The only allowed edges are between $s$ and $A$, between $A$ and $B$, and between $B$ and $t$.

Suppose that the algorithm is first presented with the $(A,B)$ edges, and then with the $(s,A),(B,t)$ edges. After reading the $(A,B)$ edges, it must "remember" all of them, since there could be only one $(s,A)$ edge and only one $(B,t)$ edge, in which case the answer depends on whether the corresponding vertices in $A$ and $B$ are connected. Since there are $2^{(n/2-1)^2}$ choices for the $(A,B)$ edges, the algorithm must have a memory of at least $(n/2-1)^2$ bits (since after reading the $(A,B)$ edges, it could be in any of $2^{(n/2-1)^2}$ possible states).

Answered by Yuval Filmus on November 30, 2020

Add your own answers!

Related Questions

Is $EVEN-SAT$ $NP$-hard?

2  Asked on November 23, 2021 by zur-luria

   

Proof of the undecidability of compiler code optimization

5  Asked on November 23, 2021 by stephen-mwangi

   

What is the reason for writing parallel programs?

1  Asked on November 17, 2021 by user123521

 

Convert the given NFA to DFA

2  Asked on November 5, 2021 by vinay-varahabhotla

     

Ask a Question

Get help from others!

© 2022 AnswerBun.com. All rights reserved. Sites we Love: PCI Database, MenuIva, UKBizDB, Menu Kuliner, Sharing RPP, SolveDir