Counting triangles and the curse of the last reducer

No abstract is available for this paper.

• Publication year

  2011

• Venue

  The Web Conference

• Publication date

  2011-03-28

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/1963405.1963491
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• What is Twitter, a social network or a news media?

  2010cited by this paper
• A model of computation for MapReduce

  2010influential reference
• Data Intensive Text Processing with MapReduce

  2009cited by this paper
• DOULION: counting triangles in massive graphs with a coin

  2009cited by this paper
• Hadoop: The Definitive Guide

  2009cited by this paper
• Data Intensive Text Processing-with MapReduce

  2009cited by this paper
• Efficient semi-streaming algorithms for local triangle counting in massive graphs

  2008cited by this paper
• Planetary-scale views on a large instant-messaging network

  2008cited by this paper
• MapReduce: simplified data processing on large clusters

  2008cited by this paper
• Algorithmic Aspects of Triangle-Based Network Analysis

  2007cited by this paper
• Secondhand Brokerage: Evidence On The Importance Of Local Structure For Managers, Bankers, And Analysts

  2007cited by this paper
• Counting triangles in data streams

  2006cited by this paper
• An improved data stream algorithm for frequency moments

  2004cited by this paper
• Emergence of scaling in random networks

  1999cited by this paper
• Emergence of Scaling in Random Networks

  1999cited by this paper
• Social Capital: Its Origins and Applications in Modern Sociology

  1998cited by this paper
• Collective dynamics of ‘small-world’ networks

  1998cited by this paper
• Syntactic Clustering of the Web

  1997cited by this paper
• Social Capital in the Creation of Human Capital

  1988cited by this paper
• Arboricity and Subgraph Listing Algorithms

  1985cited by this paper

• Counting hypertriangles through hypergraph orientations

  2026cites this paper
• Graph convolutional network reconstruction with high-order node information for community detection

  2026cites this paper
• Cost-Aware Triangle Counting Over Geo-Distributed Datacenters

  2025cites this paper
• Scalable Substructure Discovery Algorithm For Homogeneous Multilayer Networks

  2025cites this paper
• TriPIM — Exact Triangle Counting on UPMEM Processing-in-Memory for Graph Analytics

  2025cites this paper
• A Summarization-Based Pattern-Aware Matrix Reordering Approach

  2025cites this paper
• Triangle Counting Over Large-Scale Directed Graphs

  2025cites this paper
• Efficient and privacy-preserving butterfly counting on encrypted bipartite graphs

  2025cites this paper
• G-SPAC: a more granular greedy graph partition algorithm with spatial locality and judgment-aware edge folding

  2025cites this paper
• Towards Faster External-Memory Graph Computing on Small Neighborhoods

  2025cites this paper
• Motif Counting in Complex Networks: A Comprehensive Survey

  2025influential citation
• Arboricity and Random Edge Queries Matter for Triangle Counting using Sublinear Queries

  2025cites this paper
• Triangle-Decomposable Graphs for Isoperimetric Robots

  2025cites this paper
• Agent-Based Triangle Counting and its Applications in Anonymous Graphs

  2024cites this paper
• Scalable Semi-Supervised Graph Learning Techniques for Anti Money Laundering

  2024cites this paper
• Substructure Discovery in Heterogeneous Multilayer Networks

  2024cites this paper
• GNN Applied to Ego-nets for Friend Suggestions

  2024cites this paper
• Optimizing N-Degree Union Problems in Graph Data Processing for Enhancing the Efficiency of Dynamic Graphs

  2024cites this paper
• Stochastic Gradient Descent for matrix completion: Hybrid parallelization on shared- and distributed-memory systems

  2024cites this paper
• Best of Both Worlds: Advantages of Hybrid Graph Sequence Models

  2024cites this paper
• Fast and Accurate Triangle Counting in Graph Streams Using Predictions

  2024cites this paper
• From Stars to Diamonds: Counting and Listing Almost Complete Subgraphs in Large Networks

  2024cites this paper
• Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient

  2024cites this paper
• Some Vignettes on Subgraph Counting Using Graph Orientations (Invited Talk)

  2023cites this paper
• Adaptive Massively Parallel Connectivity in Optimal Space

  2023cites this paper
• Engineering a Distributed-Memory Triangle Counting Algorithm

  2023cites this paper
• Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs

  2023cites this paper
• A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting in Bounded Degeneracy Graphs

  2023cites this paper
• Communication-Efficient Triangle Counting

  2023cites this paper
• Global triangle estimation based on first edge sampling in large graph streams

  2023cites this paper
• A Survey on the Densest Subgraph Problem and its Variants

  2023cites this paper
• Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks

  2023cites this paper
• Massively Parallel Computation: Algorithms and Applications

  2023cites this paper
• CFL/Dyck Reachability

  2022cites this paper
• A Novel Parallel Triangle Counting Algorithm with Reduced Communication

  2022cites this paper
• Graph Computing Systems and Partitioning Techniques: A Survey

  2022cites this paper
• Four node graphlet and triad enumeration on distributed platforms

  2022influential citation
• The Triangle-Densest-K-Subgraph Problem: Hardness, Lovász Extension, and Application to Document Summarization

  2022cites this paper
• Scaling and Load-Balancing Equi-Joins

  2022cites this paper
• Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream

  2022cites this paper
• Accelerated butterfly counting with vertex priority on bipartite graphs

  2022cites this paper
• The Complexity of Average-Case Dynamic Subgraph Counting

  2022cites this paper
• Practical Survey on MapReduce Subgraph Enumeration Algorithms

  2022cites this paper
• Triangle Counting Through Cover-Edges

  2022cites this paper
• On the Number of Graphs With a Given Histogram

  2022cites this paper
• Global Clustering Coefficient of the Products of Complete Graphs

  2022cites this paper
• Improving I/O Complexity of Triangle Enumeration

  2022cites this paper
• Scaling Equi-Joins

  2022cites this paper
• Clustering Coefficient of the Tensor Product of Graphs

  2022cites this paper
• Communication Efficient Triangle Counting

  2021cites this paper
• A NUMA-Aware Parallel Truss Decomposition Algorithm for Large Scale Graphs

  2021cites this paper
• TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata

  2021cites this paper
• Incrementalizing Graph Algorithms

  2021influential citation
• Efficient and Scalable Graph Pattern Mining on GPUs

  2021cites this paper
• Counting Simplices in Hypergraph Streams

  2021cites this paper
• Bootstrap estimators for the tail-index and for the count statistics of graphex processes

  2021cites this paper
• Distributed Enumeration of Four Node Graphlets at Quadrillion-Scale

  2021cites this paper
• FlexMiner: A Pattern-Aware Accelerator for Graph Pattern Mining

  2021cites this paper
• On the Distributed Complexity of Large-Scale Graph Computations

  2021cites this paper
• Communication-Efficient Triangle Counting under Local Differential Privacy

  2021cites this paper
• Triangle Enumeration for Billion-Scale Graphs in RDBMS

  2021cites this paper
• Trust: Triangle Counting Reloaded on GPUs

  2021cites this paper
• Triangular index of some graph products

  2021cites this paper
• Ordering heuristics for k-clique listing

  2020cites this paper
• Big Data Analytics and Knowledge Discovery: 22nd International Conference, DaWaK 2020, Bratislava, Slovakia, September 14–17, 2020, Proceedings

  2020cites this paper
• HOSA: Fast Distributed Triangle Enumerating On Tera-Edge Graphs

  2020cites this paper
• A Scalable Randomized Algorithm for Triangle Enumeration on Graphs Based on SQL Queries

  2020cites this paper
• Triangle Enumeration on Massive Graphs Using AWS Lambda Functions

  2020cites this paper
• Accelerating Truss Decomposition on Heterogeneous Processors

  2020cites this paper
• Large-scale Graph Analysis: System, Algorithm and Optimization

  2020influential citation
• Massively Parallel Algorithms for Small Subgraph Counting

  2020influential citation
• Temporal locality-aware sampling for accurate triangle counting in real graph streams

  2020cites this paper
• How to Count Triangles, without Seeing the Whole Graph

  2020cites this paper
• Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles

  2020cites this paper
• DegreeSketch: Distributed Cardinality Sketches on Massive Graphs with Applications

  2020cites this paper
• Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach

  2020cites this paper
• PACC: Large scale connected component computation on Hadoop and Spark

  2020cites this paper
• Triangle and Four Cycle Counting in the Data Stream Model

  2020cites this paper
• How the Degeneracy Helps for Triangle Counting in Graph Streams

  2020cites this paper
• Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees

  2020cites this paper
• Revisiting the Feld’s Friendship Paradox in Online Social Networks

  2020cites this paper
• Parallel Algorithms for Small Subgraph Counting

  2020cites this paper
• The Fine-Grained Complexity of Andersen's Pointer Analysis

  2020cites this paper
• Scalable Triangle Discovery Algorithm for Large Scale-Free Network with Limited Internal Memory

  2020cites this paper
• Sampling Graphlets of Multi-layer Networks: A Restricted Random Walk Approach

  2020cites this paper
• FlexGraph: Flexible partitioning and storage for scalable graph mining

  2020cites this paper
• Equivalence classes and conditional hardness in massively parallel computations

  2020cites this paper
• Pangolin: An Efficient and Flexible Graph Pattern Mining System on CPU and GPU.

  2020cites this paper
• Strongly Minimal MapReduce Algorithms: A TeraSort Case Study

  2020cites this paper
• A Comparison of MapReduce Join Algorithms

  2020cites this paper
• Parallel Batch-Dynamic 3-Vertex Subgraph Maintenance

  2020cites this paper
• Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams

  2020cites this paper
• Sandslash: a two-level framework for efficient graph pattern mining

  2020cites this paper
• Parallel Batch-Dynamic k-Clique Counting

  2020cites this paper
• Efficient Parallel Subgraph Enumeration

  2020cites this paper
• Faster sublinear approximation of the number of k-cliques in low-arboricity graphs

  2020cites this paper
• Introduction to DiNA: An Extendable Web-application for Directed Network Analysis

  2020cites this paper
• Application-Aware Adaptive Partitioning for Graph Processing Systems

  2019cites this paper
• Massive Graph Analysis in the Data Stream Model

  2019influential citation
• Scalable Subgraph Counting: Methods Behind the Madness WWW 2019 Tutorial

  2019cites this paper