LOTUS: locality optimizing triangle counting
Abstract
Triangle Counting (TC) is a basic graph mining problem with numerous applications. However, the large size of real-world graphs has a severe effect on TC performance.
Related papers
- Triangle Counting on Tensor Cores PPoPP 2025
- The Virtues of Eta-Expansion JFP 1995
- Synthesizing parallel graph programs via automated planning PLDI 2015
- Concurrent Immediate Reference Counting PLDI 2024
- One-Bit Counts between Unique and Sticky ISMM 1998
- A polyhedral compilation framework for loops with dynamic data-dependent bounds CC 2018
- The fire triangle: how to mix substitution, dependent elimination, and effects POPL 2020
- Equality Saturation for Quantum Circuit Optimization PLDI 2026