A Note on Exponential-Time Algorithms for Linearwidth

Abstract

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

4 pages