Faster deterministic algorithm for Cactus Vertex Deletion

Dekel Tsur

doi:https://doi.org/10.1016/j.ipl.2022.106317

Faster deterministic algorithm for Cactus Vertex Deletion

Dekel Tsur

Department of Computer Science

Ben-Gurion University of the Negev

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

Abstract

In the CACTUS VERTEX DELETION (resp., EVEN CYCLE TRANSVERSAL) 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 in which every edge belongs to at most one cycle (resp., a graph without even cycles). In this paper we give deterministic O^⁎(13.69^k)-time algorithms for CACTUS VERTEX DELETION and EVEN CYCLE TRANSVERSAL.

Original language	American English
Article number	106317
Journal	Information Processing Letters
Volume	179
DOIs	https://doi.org/10.1016/j.ipl.2022.106317
State	Published - 1 Jan 2023

Keywords

Algorithms
Branching algorithms
Graph algorithms
Parameterized complexity

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

https://doi.org/10.1016/j.ipl.2022.106317

Cite this

@article{81d0e0d49152441a9c8972cbc864d1bb,

title = "Faster deterministic algorithm for Cactus Vertex Deletion",

abstract = "In the CACTUS VERTEX DELETION (resp., EVEN CYCLE TRANSVERSAL) 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 in which every edge belongs to at most one cycle (resp., a graph without even cycles). In this paper we give deterministic O⁎(13.69k)-time algorithms for CACTUS VERTEX DELETION and EVEN CYCLE TRANSVERSAL.",

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

author = "Dekel Tsur",

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

year = "2023",

month = jan,

day = "1",

doi = "https://doi.org/10.1016/j.ipl.2022.106317",

language = "American English",

volume = "179",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

}

TY - JOUR

T1 - Faster deterministic algorithm for Cactus Vertex Deletion

AU - Tsur, Dekel

PY - 2023/1/1

Y1 - 2023/1/1

N2 - In the CACTUS VERTEX DELETION (resp., EVEN CYCLE TRANSVERSAL) 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 in which every edge belongs to at most one cycle (resp., a graph without even cycles). In this paper we give deterministic O⁎(13.69k)-time algorithms for CACTUS VERTEX DELETION and EVEN CYCLE TRANSVERSAL.

AB - In the CACTUS VERTEX DELETION (resp., EVEN CYCLE TRANSVERSAL) 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 in which every edge belongs to at most one cycle (resp., a graph without even cycles). In this paper we give deterministic O⁎(13.69k)-time algorithms for CACTUS VERTEX DELETION and EVEN CYCLE TRANSVERSAL.

KW - Algorithms

KW - Branching algorithms

KW - Graph algorithms

KW - Parameterized complexity

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

U2 - https://doi.org/10.1016/j.ipl.2022.106317

DO - https://doi.org/10.1016/j.ipl.2022.106317

M3 - Article

SN - 0020-0190

VL - 179

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106317

ER -

Faster deterministic algorithm for Cactus Vertex Deletion

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this