Kernel for Kt-FREE EDGE DELETION

Dekel Tsur

doi:10.1016/j.ipl.2020.106082

Kernel for K_t-FREE EDGE DELETION

Dekel Tsur

Department of Computer Science

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

3 Scopus citations

Abstract

In the K_t-FREE EDGE 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 edges of G whose removal results in a graph with no clique of size t. In this paper we give a kernel to this problem with O(k^t−1) vertices and edges.

Original language	English
Article number	106082
Journal	Information Processing Letters
Volume	167
DOIs	https://doi.org/10.1016/j.ipl.2020.106082
State	Published - 1 Apr 2021

Keywords

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

Cite this

@article{b66b6e89ab584761b0dd42e69c980b02,

title = "Kernel for Kt-FREE EDGE DELETION",

abstract = "In the Kt-FREE EDGE 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 edges of G whose removal results in a graph with no clique of size t. In this paper we give a kernel to this problem with O(kt−1) vertices and edges.",

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

author = "Dekel Tsur",

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

year = "2021",

month = apr,

day = "1",

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

language = "English",

volume = "167",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Kernel for Kt-FREE EDGE DELETION

AU - Tsur, Dekel

PY - 2021/4/1

Y1 - 2021/4/1

N2 - In the Kt-FREE EDGE 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 edges of G whose removal results in a graph with no clique of size t. In this paper we give a kernel to this problem with O(kt−1) vertices and edges.

AB - In the Kt-FREE EDGE 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 edges of G whose removal results in a graph with no clique of size t. In this paper we give a kernel to this problem with O(kt−1) vertices and edges.

KW - Graph algorithms

KW - Kernelization

KW - Parameterized complexity

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

U2 - 10.1016/j.ipl.2020.106082

DO - 10.1016/j.ipl.2020.106082

M3 - Article

AN - SCOPUS:85098605939

SN - 0020-0190

VL - 167

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106082

ER -