Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
External memory algorithms
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Reductions in streaming algorithms, with an application to counting triangles in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Heuristics for semi-external depth first search on directed graphs
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Efficient algorithms for new computational models
Efficient algorithms for new computational models
UbiCrawler: a scalable fully distributed web crawler
Software—Practice & Experience
Graph distances in the streaming model: the value of space
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Trading off space for passes in graph streaming problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Stanford WebBase components and applications
ACM Transactions on Internet Technology (TOIT)
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
The Web as a graph: How far we are
ACM Transactions on Internet Technology (TOIT)
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
A Heuristic Strong Connectivity Algorithm for Large Graphs
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Small stretch spanners in the streaming model: new algorithms and experiments
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Finding graph matchings in data streams
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Adapting parallel algorithms to the W-stream model, with applications to graph problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A topological sorting algorithm for large graphs
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
In this paper we present the first algorithm to compute the Strongly Connected Components of a graph in the datastream model (W-Stream), where the graph is represented by a stream of edges and we are allowed to produce intermediate output streams. The algorithm is simple, effective, and can be implemented with few lines of code: it looks at each edge in the stream, and selects the appropriate action with respect to a tree T, representing the graph connectivity seen so far. We analyze the theoretical properties of the algorithm: correctness, memory occupation (O(n log n)), per item processing time (bounded by the current height of T), and number of passes (bounded by the maximal height of T). We conclude by presenting a brief experimental evaluation of the algorithm against massive synthetic and real graphs that confirms its effectiveness: with graphs with up to 100M nodes and 4G edges, only few passes are needed, and millions of edges per second are processed.