Faster deterministic algorithm for Co-Path Set

•We give a deterministic O⁎(2k)-time algorithm for Co-Path Set.•Our result improves the result of Zhang et al. for this problem which gave an O⁎(2.45k)-time algorithm.•The improved time complexity is achieved by showing that a bad branching is preceded by an application of a reduction rule. In the C...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information processing letters Ročník 180; s. 106335
Hlavný autor: Tsur, Dekel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.02.2023
Predmet:
Branching algorithms
Graph algorithms
Parameterized complexity
Parameterized complexity
Branching algorithms
Graph algorithms
ISSN:0020-0190, 1872-6119
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•We give a deterministic O⁎(2k)-time algorithm for Co-Path Set.•Our result improves the result of Zhang et al. for this problem which gave an O⁎(2.45k)-time algorithm.•The improved time complexity is achieved by showing that a bad branching is preceded by an application of a reduction rule. In the Co-Path Set 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 edges whose removal from G results in a graph in which every connected component is a path. In this paper we give a deterministic O⁎(2k)-time algorithm for Co-Path Set.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2022.106335