Clique Counting in MapReduce
DOI10.1145/2794080zbMath1347.68284arXiv1403.0734OpenAlexW4292080745MaRDI QIDQ2828209
Marco Finocchi, Irene Finocchi, Emanuele G. Fusco
Publication date: 24 October 2016
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.0734
Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colorful triangle counting and a \textsc{MapReduce} implementation
- Finding and counting given length cycles
- Combinatorial algorithms for feedback problems in directed graphs
- A note on an inequality involving the normal distribution
- Algorithms and Data Structures for External Memory
- Approximate Counting of Cycles in Streams
- Emergence of Scaling in Random Networks
- Sorting, Searching, and Simulation in the MapReduce Framework
- Counting Arbitrary Subgraphs in Data Streams
- Approximating Clustering Coefficient and Transitivity
- Estimating Clustering Indexes in Data Streams
- Arboricity and Subgraph Listing Algorithms
- Finding a Minimum Circuit in a Graph
- Listing Triangles
- Triangle Listing Algorithms: Back from the Diversion
- Computing and Combinatorics
- Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
This page was built for publication: Clique Counting in MapReduce
