Search Results - "kernelization algorithm"

A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

“…For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π…”
Get full text

An improved kernelization algorithm for r-Set Packing by Abu-Khzam, Faisal N.

“… ) , where k is the input parameter. Such parameterized reductions are known as kernelization algorithms, and a reduced instance is called a problem kernel…”
Get full text

A 5k-vertex kernel for P2-packing by Li, Wenjun, Ye, Junjie, Cao, Yixin

“…) paths each of length two. We continue the study of its kernelization algorithms, and develop a 5k-vertex kernel…”
Get full text

Space limited linear-time graph algorithms on big data by Chen, Jianer, Chu, Zirui, Guo, Ying, Yang, Wei

“…) randomized kernelization algorithms of time O(N) and space O(kO(1)) for a number of well-known NP-hard problems…”
Get full text

A Kernelization Algorithm for Finding a Perfect Phylogeny From Mixed Tumor Samples by Sheu, Wen-Horng, Wang, Biing-Feng

“…The split-row problem (SR), introduced by Hajirasouliha and Raphael [WABI 2014], models an effective method for reconstructing a perfect phylogeny from mixed…”
Get full text

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data by Chen, Jianer, Huang, Qin, Kanj, Iyad, Xia, Ge

“…Based on well-known complexity theory conjectures, any polynomial-time kernelization algorithm for the NP-hard Line- Cover problem produces a kernel of size Ω ( k 2…”
Get full text

Efficient Kernelization Algorithm for Bipartite Graph Matching by Wu, Guang, Gan, Xinbiao, Pang, Zhengbin, Huang, Bo, Bopin Ran

“…Finding the maximum matching in bipartite graphs is a fundamental graph operation widely used in various fields. To expedite the acquisition of the maximum…”
Get full text

An improved kernelization algorithm for Trivially Perfect Editing by Dumas, Maël, Perez, Anthony

“…In the Trivially Perfect Editing problem one is given an undirected graph \(G = (V,E)\) and an integer \(k\) and seeks to add or delete at most \(k\) edges in…”
Get full text

A Polynomial Kernel for Block Graph Deletion by Kim, Eun Jung, Kwon, O-Joung

“…In the Block Graph Deletion problem, we are given a graph G on n vertices and a positive integer k , and the objective is to check whether it is possible to…”
Get full text

A kernel of order 2 k − c log k for vertex cover by Lampis, Michael

“…In a recent paper Soleimanfallah and Yeo proposed a kernelization algorithm for vertex cover which, for any fixed constant c, produces a kernel of order 2 k…”
Get full text

A kernel of order 2k - c log k for vertex cover by LAMPIS, Michael

“…In a recent paper Soleimanfallah and Yeo proposed a kernelization algorithm for vertex cover which, for any fixed constant c, produces a kernel of order 2k-c in polynomial time…”
Get full text

A 5k kernel for P2-packing in net-free graphs by Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung

“… This problem is NP-hard for net-free graphs. In this paper, we give a kernelization algorithm for the kP 2 -Packing problem in net-free graphs…”
Get full text

On optimal streaming kernelization algorithms by Feng, Hao, Yang, Wei, Chen, Jianer

Get full text

Exact and kernelization algorithms for Closet String by Latorre, Omar

“… CLOSEST STRING is an NP-hard problem. This paper proposes two linear-time algorithms, one for the general case, a kernelization algorithm, and the other for three-strings, a linear-time algorithm called Minimization First Algorithm (MFA…”
Get full text

A quasi-quadratic vertex-kernel for Cograph Edge Editing by Crespelle, Christophe, Pellerin, Rémi, Thomassé, Stéphan

“…We provide a O(k2logk) vertex kernel for cograph edge editing. This improves a cubic kernel found by Guillemot, Havet, Paul and Perez (Guillemot et al., 2010)…”
Get full text

Parameterized complexity for iterated type partitions and modular-width by Cordasco, Gennaro, Gargano, Luisa, Rescigno, Adele A.

“…This paper deals with the complexity of some natural graph problems parameterized by some measures that are restrictions of clique-width, such as modular-width…”
Get full text

Algorithms for comparing large pedigree graphs by Belal, Nahla A., Amar, Lamiaa A., Sherief, Hany H.

“…The importance of pedigrees is translated by geneticists as a tool for diagnosing genetic diseases. Errors resulting during collection of data and missing…”
Get full text

A Cubic Vertex-Kernel for Trivially Perfect Editing by Dumas, Maël, Perez, Anthony, Todinca, Ioan

“…We consider the Trivially Perfect Editing problem, where one is given an undirected graph G = ( V , E ) and a parameter k ∈ N and seeks to edit (add or delete)…”
Get full text

On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems by Guillemot, Sylvain, Havet, Frédéric, Paul, Christophe, Perez, Anthony

“…Given a graph G =( V , E ) and a positive integer k , an edge modification problem for a graph property  Π consists in deciding whether there exists a set F of…”
Get full text

Parameterized Complexity of Streaming Diameter and Connectivity Problems by Oostveen, Jelle J., van Leeuwen, Erik Jan

“…We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the streaming paradigm. On the positive end, we show that knowing…”
Get full text