LOTUS: locality optimizing triangle counting
Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck
2022Year
6Citations
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.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 5d29f261-e4f7-47cd-88b1-e1dd1ed92926Related papers
- Accelerating Triangle Counting on GPULin Hu, Lei Zou, Yu LiuSIGMOD 2021 · 38 citations
- How to Count Triangles, without Seeing the Whole GraphSuman K. Bera, C. SeshadhriKDD 2020 · 23 citations
- Neural Subgraph Counting with Wasserstein EstimatorHanchen Wang, Rong Hu, Ying Zhang, Lu Qin et al.SIGMOD 2022 · 37 citations
- Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate EdgesXiangyang Gou, Lei ZouSIGMOD 2021 · 26 citations
- TriPoll: computing surveys of triangles in massive-scale temporal graphs with metadataTrevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest et al.SC 2021 · 9 citations
