Faster deterministic algorithm for Co-Path Set

Dekel Tsur

doi:10.1016/j.ipl.2022.106335

Faster deterministic algorithm for Co-Path Set

Dekel Tsur

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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^⁎(2^k)-time algorithm for CO-PATH SET.

Original language	English
Article number	106335
Journal	Information Processing Letters
Volume	180
DOIs	https://doi.org/10.1016/j.ipl.2022.106335
State	Published - 1 Feb 2023

Keywords

Branching algorithms
Graph algorithms
Parameterized complexity

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2022.106335

Cite this

@article{302daadd7b5c4c9bbcfaf386571a5351,

title = "Faster deterministic algorithm for Co-Path Set",

abstract = "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.",

keywords = "Branching algorithms, Graph algorithms, Parameterized complexity",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier B.V.",

year = "2023",

month = feb,

day = "1",

doi = "10.1016/j.ipl.2022.106335",

language = "English",

volume = "180",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Faster deterministic algorithm for Co-Path Set

AU - Tsur, Dekel

PY - 2023/2/1

Y1 - 2023/2/1

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

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

KW - Branching algorithms

KW - Graph algorithms

KW - Parameterized complexity

UR - http://www.scopus.com/inward/record.url?scp=85139728848&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2022.106335

DO - 10.1016/j.ipl.2022.106335

M3 - Article

AN - SCOPUS:85139728848

SN - 0020-0190

VL - 180

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106335

ER -

Faster deterministic algorithm for Co-Path Set

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this