On Triangle Counting Parameterized by Twin-Width

Stefan Kratsch, Florian Nelles, Alexandre Simon

In this report we present an algorithm solving Triangle Counting in time $O(d^{2}n+m)$, where n and m, respectively, denote the number of vertices and edges of a graph G and d denote…