A Note on Exponential-Time Algorithms for Linearwidth

10/05/2020
by   Yasuaki Kobayashi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2021

Feedback Vertex Set on Geometric Intersection Graphs

In this paper, we present an algorithm for computing a feedback vertex s...
research
03/14/2018

H-colouring P_t-free graphs in subexponential time

A graph is called P_t-free if it does not contain the path on t vertices...
research
08/18/2023

Counting and Sampling Labeled Chordal Graphs in Polynomial Time

We present the first polynomial-time algorithm to exactly compute the nu...
research
08/17/2020

Algorithm for SIS and MultiSIS problems

SIS problem has numerous applications in cryptography. Known algorithms ...
research
07/22/2019

The k-Dimensional Weisfeiler-Leman Algorithm

In this note, we provide details of the k-dimensional Weisfeiler-Leman A...
research
06/17/2020

Bute: A Bottom-Up Exact Solver for Treedepth (Submitted to PACE 2020 under username peaty)

This note introduces the exact solver Bute for the exact treedepth probl...
research
12/01/2021

Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers

We make several advances broadly related to the maintenance of electrica...

Please sign up or login with your details

Forgot password? Click here to reset