论文标题
在三角计数上通过双宽度进行参数
On Triangle Counting Parameterized by Twin-Width
论文作者
论文摘要
在本报告中，我们提出了一个算法解决三角形的算法，该算法在时间$ o（d^2n+m）$中分别表示N和M，其中N和M表示图G和D的顶点和边缘的数量和D表示其Twintth，这是最近引入的图形参数。我们假设给出了G的D-征收序列的紧凑表示。
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.
