Random sampling with a reservoir
ACM Transactions on Mathematical Software (TOMS)
Arboricity and subgraph listing algorithms
SIAM Journal on Computing
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
Testing triangle-freeness in general graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Counting triangles in data streams
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Main-memory triangle computations for very large (sparse (power-law)) graphs
Theoretical Computer Science
Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
DOULION: counting triangles in massive graphs with a coin
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph Twiddling in a MapReduce World
Computing in Science and Engineering
Spectral Counting of Triangles in Power-Law Networks via Element-Wise Sparsification
ASONAM '09 Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining
Is a friend a friend?: investigating the structure of friendship networks in virtual worlds
CHI '10 Extended Abstracts on Human Factors in Computing Systems
Counting triangles and the curse of the last reducer
Proceedings of the 20th international conference on World wide web
Triangle listing in massive networks and its applications
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Improved sampling for triangle counting with MapReduce
ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology
New streaming algorithms for counting triangles in graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Colorful triangle counting and a MapReduce implementation
Information Processing Letters
Finding, counting and listing all triangles in large graphs, an experimental study
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
The runtime abort graph and its application to software transactional memory optimization
CGO '11 Proceedings of the 9th Annual IEEE/ACM International Symposium on Code Generation and Optimization
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
Inexact subgraph isomorphism in MapReduce
Journal of Parallel and Distributed Computing
PATRIC: a parallel algorithm for counting triangles in massive networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |