On Triangle Counting Parameterized by Twin-Width

02/14/2022

∙

by   Stefan Kratsch, et al.

∙

0

∙

share

In this report we present an algorithm solving Triangle Counting in time O(d^2n+m), where n and m, respectively, denote the number of vertices and edges of a graph G and d denotes its twin-width, a recently introduced graph parameter. We assume that a compact representation of a d-contraction sequence of G is given.