0
喜欢
0
书签
声明论文
k-Connectivity in the Semi-Streaming Model   
摘  要:   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(k2n) to process each input edge. The second algorithm reads the input k +1 times and needs time O(k +�(n)) per input edge. Using its constructed subgraph the second algorithm can also generate all l-separators of the input graph for all l < k.
发  表:   Computing Research Repository  2006

论文统计图
共享有7个版本
 [展开全部版本] 

Bibtex
创新指数 
阅读指数 
重现指数 
论文点评
还没有人点评哦

Feedback
Feedback
Feedback
我想反馈:
排行榜