Faster algorithm for pathwidth one vertex deletion

In the Pathwidth One Vertex Deletion (POVD) problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k vertices whose removal from G results in a graph with pathwidth at most 1. In this paper we give an algorithm for POVD whose running time is O⁎(3...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 921; s. 63 - 74
Hlavný autor: Tsur, Dekel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 19.06.2022
Predmet:
Branching algorithms
Graph algorithms
Parameterized complexity
Parameterized complexity
Branching algorithms
Graph algorithms
ISSN:0304-3975, 1879-2294
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In the Pathwidth One Vertex Deletion (POVD) problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k vertices whose removal from G results in a graph with pathwidth at most 1. In this paper we give an algorithm for POVD whose running time is O⁎(3.888k).
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2022.04.001