Faster algorithms and a smaller kernel for CLIQUES OR TREES VERTEX DELETION

Dekel Tsur

doi:10.1016/j.ipl.2025.106570

Faster algorithms and a smaller kernel for CLIQUES OR TREES VERTEX DELETION

Dekel Tsur

Department of Computer Science

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

Abstract

In the CLIQUES OR TREES VERTEX DELETION 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 result in a graph in which every connected component is either a clique or a tree. In this paper we give an O^⁎(3.46^k)-time deterministic algorithm, an O^⁎(3.103^k)-time randomized algorithm, and a kernel with O(k⁴) vertices for CLIQUES OR TREES VERTEX DELETION.

Original language	English
Article number	106570
Journal	Information Processing Letters
Volume	190
DOIs	https://doi.org/10.1016/j.ipl.2025.106570
State	Published - 1 Aug 2025

Keywords

Branching algorithms
Graph algorithms
Kernelization
Parameterized complexity

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2025.106570

Cite this

@article{46ca1b3c7ffb436cb5c405cf07d6cb4b,

title = "Faster algorithms and a smaller kernel for CLIQUES OR TREES VERTEX DELETION",

abstract = "In the CLIQUES OR TREES VERTEX DELETION 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 result in a graph in which every connected component is either a clique or a tree. In this paper we give an O⁎(3.46k)-time deterministic algorithm, an O⁎(3.103k)-time randomized algorithm, and a kernel with O(k4) vertices for CLIQUES OR TREES VERTEX DELETION.",

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

author = "Dekel Tsur",

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

year = "2025",

month = aug,

day = "1",

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

language = "English",

volume = "190",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Faster algorithms and a smaller kernel for CLIQUES OR TREES VERTEX DELETION

AU - Tsur, Dekel

PY - 2025/8/1

Y1 - 2025/8/1

N2 - In the CLIQUES OR TREES VERTEX DELETION 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 result in a graph in which every connected component is either a clique or a tree. In this paper we give an O⁎(3.46k)-time deterministic algorithm, an O⁎(3.103k)-time randomized algorithm, and a kernel with O(k4) vertices for CLIQUES OR TREES VERTEX DELETION.

AB - In the CLIQUES OR TREES VERTEX DELETION 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 result in a graph in which every connected component is either a clique or a tree. In this paper we give an O⁎(3.46k)-time deterministic algorithm, an O⁎(3.103k)-time randomized algorithm, and a kernel with O(k4) vertices for CLIQUES OR TREES VERTEX DELETION.

KW - Branching algorithms

KW - Graph algorithms

KW - Kernelization

KW - Parameterized complexity

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

U2 - 10.1016/j.ipl.2025.106570

DO - 10.1016/j.ipl.2025.106570

M3 - Article

AN - SCOPUS:85217830214

SN - 0020-0190

VL - 190

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106570

ER -

Faster algorithms and a smaller kernel for CLIQUES OR TREES VERTEX DELETION

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this