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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 921; S. 63 - 74
1. Verfasser: Tsur, Dekel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 19.06.2022
Schlagworte:
Branching algorithms
Graph algorithms
Parameterized complexity
Parameterized complexity
Branching algorithms
Graph algorithms
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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