A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
On finding common neighborhoods in massive graphs
Theoretical Computer Science
Counting triangles in data streams
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Estimating PageRank on graph streams
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Main-memory triangle computations for very large (sparse (power-law)) graphs
Theoretical Computer Science
DOULION: counting triangles in massive graphs with a coin
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Optimal sampling from sliding windows
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Estimating clustering indexes in data streams
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
Estimating PageRank on graph streams
Journal of the ACM (JACM)
Structural trend analysis for online social networks
Proceedings of the VLDB Endowment
Approximate counting of cycles in streams
ESA'11 Proceedings of the 19th European conference on Algorithms
Improved sampling for triangle counting with MapReduce
ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology
Optimal sampling from sliding windows
Journal of Computer and System Sciences
Colorful triangle counting and a MapReduce implementation
Information Processing Letters
Graph sketches: sparsification, spanners, and subgraphs
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Counting arbitrary subgraphs in data streams
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Streaming algorithms measured in terms of the computed quantity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
On the streaming complexity of computing local clustering coefficients
Proceedings of the sixth ACM international conference on Web search and data mining
A space efficient streaming algorithm for triangle counting using the birthday paradox
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Parallel triangle counting in massive streaming graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
How hard is counting triangles in the streaming model?
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Counting and sampling triangles from a graph stream
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
We present three streaming algorithms that (ε,δ)– approximate the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presented algorithms are inversely proportional to the number of triangles while, for some families of graphs, the space usage is improved. We also prove a lower bound, based on the number of triangles, which indicates that our first algorithm behaves almost optimally on graphs with constant degrees.