In this note, we give an algorithm that computes the linearwidth of input $n$-vertex graphs in time $O^*(2^n)$, which improves a trivial $O^*(2^m)$-time algorithm, where $n$ and $m$ the number of vertices and edges, respectively.

翻译：在本说明中,我们给出一种算法,以时间计算输入量的线形(n)n$-顶点图)$O ⁇ (2 ⁇ n)$(美元),从而改进了一个微不足道的o ⁇ (2 ⁇ m)$(美元)-时间算法,其中的顶点和边缘数分别为n美元和1美元。