k-Connectivity in the Semi-Streaming Model

Details k-Connectivity in the Semi-Streaming Model k-Connectivity in the Semi-Streaming Model

2006-08-16

arxiv.org/abs/cs/0608066v1

Computer Science

Discrete Mathematics

13 pages, submitted to Theoretical Computer Science

Scientific paper

We present the first semi-streaming algorithms to determine k-connectivity of an undirected graph with k being any constant. The semi-streaming model for graph algorithms was introduced by Muthukrishnan in 2003 and turns out to be useful when dealing with massive graphs streamed in from an external storage device. Our two semi-streaming algorithms each compute a sparse subgraph of an input graph G and can use this subgraph in a postprocessing step to decide k-connectivity of G. To this end the first algorithm reads the input stream only once and uses time O(k^2*n) to process each input edge. The second algorithm reads the input k+1 times and needs time O(k+alpha(n)) per input edge. Using its constructed subgraph the second algorithm can also generate all l-separators of the input graph for all l

Affiliated with

Also associated with

No associations

Rating

k-Connectivity in the Semi-Streaming Model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with k-Connectivity in the Semi-Streaming Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and k-Connectivity in the Semi-Streaming Model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-219930