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

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

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

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

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

“…The P2-packing problem asks whether a graph contains k vertex-disjoint (not necessarily induced) paths each of length two. We continue the study of its…”
Získat plný text

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

“…We study algorithms for graph problems in which the graphs are of extremely large size N so that super-linear time ω(N) or linear space Θ(N) would become…”
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 Ω…”
Získat plný text

A Polynomial Kernel for Block Graph Deletion Autor 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…”
Získat plný text

A kernel of order 2 k − c log k for vertex cover Autor 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 −…”
Získat plný text

A kernel of order 2k - c log k for vertex cover Autor 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…”
Získat plný text

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

“…Given a graph G = (V, E), a P 2 -packing P is a collection of vertex disjoint copies of P 2 s in G where a P 2 is a simple path with three vertices and two…”
Získat plný text