LOTUS: locality optimizing triangle counting
Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck
2022年份
6被引次数
摘要
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.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Accelerating Triangle Counting on GPULin Hu, Lei Zou, Yu LiuSIGMOD 2021 · 被引用 38 次
- How to Count Triangles, without Seeing the Whole GraphSuman K. Bera, C. SeshadhriKDD 2020 · 被引用 23 次
- Neural Subgraph Counting with Wasserstein EstimatorHanchen Wang, Rong Hu, Ying Zhang, Lu Qin 等SIGMOD 2022 · 被引用 37 次
- Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate EdgesXiangyang Gou, Lei ZouSIGMOD 2021 · 被引用 26 次
- TriPoll: computing surveys of triangles in massive-scale temporal graphs with metadataTrevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest 等SC 2021 · 被引用 9 次
