Kernel for Kt-FREE EDGE DELETION

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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.

Original languageEnglish
Article number106082
JournalInformation Processing Letters
Volume167
DOIs
StatePublished - 1 Apr 2021

Keywords

  • Graph algorithms
  • Kernelization
  • Parameterized complexity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Kernel for Kt-FREE EDGE DELETION'. Together they form a unique fingerprint.

Cite this