Výsledky vyhledávání - "Kernelization algorithms"

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

Získat plný text

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data Autor 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…”
Získat plný text

Exact and kernelization algorithms for Closet String Autor 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…”
Získat plný text

A quasi-quadratic vertex-kernel for Cograph Edge Editing Autor 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)…”
Získat plný text

Parameterized complexity for iterated type partitions and modular-width Autor 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…”
Získat plný text

Algorithms for comparing large pedigree graphs Autor 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…”
Získat plný text

A Cubic Vertex-Kernel for Trivially Perfect Editing Autor 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)…”
Získat plný text

On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems Autor 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…”
Získat plný text

Exploiting \(\mathbf{c}\)-Closure in Kernelization Algorithms for Graph Problems Autor Koana, Tomohiro, Komusiewicz, Christian, Sommer, Frank

“… We show that c-closure can be applied in kernelization algorithms for several classic graph problems…”
Získat plný text

Polynomial kernels for Proper Interval Completion and related problems Autor Bessy, Stéphane, Perez, Anthony

“…Given a graph G=(V,E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V×V)∖E such…”
Získat plný text

On the kernelization of ranking r-CSPs: Linear vertex-kernels for generalizations of Feedback Arc Set and Betweenness in tournaments Autor Perez, Anthony

“…An instance of a rankingr-constraint satisfaction problem (ranking r-CSP for short) consists of a ground set of vertices V, an arity r⩾2, a parameter k∈N and a…”
Získat plný text

Experimental evaluation of kernelization algorithms to Dominating Set Autor Nadara, Wojciech

“…The theoretical notions of graph classes with bounded expansion and that are nowhere dense are meant to capture structural sparsity of real world networks that…”
Získat plný text

FPT and kernelization algorithms for the k-in-a-tree problem Autor Gomes, Guilherme C M, dos Santos, Vinicius F, Murilo V G da Silva, Szwarcfiter, Jayme L

“…The three-in-a-tree problem asks for an induced tree of the input graph containing three mandatory vertices. In 2006, Chudnovsky and Seymour [Combinatorica,…”
Získat plný text

A Cubic Kernel for Feedback Vertex Set and Loop Cutset Autor Bodlaender, Hans L., van Dijk, Thomas C.

“…The Feedback Vertex Set problem on unweighted, undirected graphs is considered. Improving upon a result by Burrage et al. (Proceedings 2nd International…”
Získat plný text

Kernelization Algorithms for Packing Problems Allowing Overlaps (Extended Version) Autor Fernau, Henning, López-Ortiz, Alejandro, Romero, Jazmín

“…We consider the problem of discovering overlapping communities in networks which we model as generalizations of Graph Packing problems with overlap. We seek a…”
Získat plný text

A kernelization algorithm for d-Hitting Set Autor 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 π…”
Získat plný text

Space limited linear-time graph algorithms on big data Autor 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…”
Získat plný text

An improved kernelization algorithm for r-Set Packing Autor 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…”
Získat plný text

Combining Crown Structures for Vulnerability Measures Autor Casel, Katrin, Friedrich, Tobias, Niklanovits, Aikaterini, Simonov, Kirill, Zeif, Ziena

“… The main focus of our paper is on kernelization algorithms tailored to both measures. We capitalize on the structural attributes inherent in different crown…”
Získat plný text

Kernelizations for the hybridization number problem on multiple nonbinary trees Autor van Iersel, Leo, Kelk, Steven, Scornavacca, Celine

“… from T and has reticulation number at most k. We show two kernelization algorithms for Hybridization Number, with kernel sizes 4k(5k)t and 20k2(Δ+−1…”
Získat plný text