research
∙
06/05/2021
Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering
Triangle counting is a fundamental technique in network analysis, that h...
share
research
∙
10/16/2020
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
Counting homomorphisms of a constant sized pattern graph H in an input g...
research
∙
11/24/2019
Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE
Subgraph counting is a fundamental task in network analysis. Typically, ...
research
∙
11/14/2019