类 型
4 篇文献
 
Weighted Matching in the Semi-Streaming Model  
Abstract. We reduce the best known approximation ratio for finding a weighted match- ing of a graph using a one-pass semi-streaming algorithm from,5.828 to 5.585. The semi-streaming model forbids rand......
Computing Research Repository  2007
0次引用 0 0
Weighted Matching in the Semi-Streaming Model  
We reduce the best known approximation ratio for finding a weighted matching of a graph using a one-pass semi-streaming algorithm from 5.828 to 5.585. The semi-streaming model forbids random access to......
Symposium on Theoretical Aspects of Computer Science  2008
8次引用 0 0
Intractability of min- and max-cut in streaming graphs  
We show that the exact computation of a minimum or a maximum cut of a given graph G is out of reach for any one-pass streaming algorithm, that is, for any algorithm that runs over the input stream of......
Information Processing Letters  2011
0次引用 0 0
Graph Distances in the Data-Stream Model  
We explore problems related to computing graph distances in the data-stream model. The goal is to design algorithms that can process the edges of a graph in an arbitrary order given only a limited amo......
Siam Journal on Computing  2008
20次引用 0 0

Feedback
Feedback
Feedback
我想反馈:
排行榜