I/O-Efficient Algorithms on Triangle Listing and Counting

DOI10.1145/2691190.2691193zbMath1474.68226OpenAlexW2080312846MaRDI QIDQ5012504

Yufei Tao, Chin-Wan Chung, Xiaocheng Hu

Publication date: 25 November 2021

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2691190.2691193

zbMATH Keywords

graphstriangle countingI/O-efficient algorithmstriangle listing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

iTri: index-based triangle listing in massive graphs ⋮ Summarized bit batch-based triangle listing in massive graphs ⋮ Parameterized aspects of triangle enumeration ⋮ I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration

This page was built for publication: I/O-Efficient Algorithms on Triangle Listing and Counting