Graph Distances in the Data-Stream Model (2008)
Feigenbaum, Joan, Kannan, Sampth, Mcgregor, Andrew, Suri, Siddarth, Zhang, Jian
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...