Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
Daniel Paul-Pena, C. Seshadhri
Counting small patterns in a large dataset is a fundamental algorithmic task. The most common version of this task is subgraph/homomorphism counting, wherein we count the number of…
cs.DS2024
Improved Massively Parallel Triangle Counting in Rounds
Quanquan C. Liu, C. Seshadhri
In this short note, we give a novel algorithm for round triangle counting in bounded arboricity graphs. Counting triangles in rounds (exactly) is listed as one of the…