类 型
5 篇文献
 
Optimal per-edge processing times in the semi-streaming model  
We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tasks. The semi-streami......
Information Processing Letters  2007
4次引用 0 0
Optimal Per-Edge Processing Times in the Semi-Streaming Model  
Computing Research Repository  2007
0次引用 0 0
Graph Mining on Streams  
1次引用 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
Chapter 13 A SURVEY ON STREAMING ALGORITHMS FOR MASSIVE GRAPHS  
Keywords: Streaming is an important paradigm for handling massive graphs that are too large to fit in the main memory. In the streaming computational model, algorithms are restricted to use much less ......
0次引用 0 0

Feedback
Feedback
Feedback
我想反馈:
排行榜