A Note on Exponential-Time Algorithms for Linearwidth

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.

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Kobayashi, Yasuaki, Nakahata, Yu
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 05.03.2021
Subjects
Algorithms
Apexes
Computer Science - Data Structures and Algorithms
Graph theory
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.2010.02388