Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations
نویسندگان
چکیده
In the {Claw, Diamond}-Free Edge Deletion problem, we are given a graph G and an integer k > 0, the question is whether there are at most k edges whose deletion results in a graph without claws and diamonds as induced graphs. Based on some refined observations, we propose a kernel of O(k3) vertices and O(k4) edges, significantly improving the previous kernel of O(k12) vertices and O(k24) edges. In addition, we derive an O∗(3.792k)-time algorithm for the {Claw, Diamond}-Free Edge Deletion problem.
منابع مشابه
Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion
A diamond is a graph obtained by removing an edge from a complete graph on four vertices. A graph is diamond-free if it does not contain an induced diamond. The Diamond-free Edge Deletion problem asks to find whether there exist at most k edges in the input graph whose deletion results in a diamond-free graph. The problem was proved to be NP-complete and a polynomial kernel of O(k4) vertices wa...
متن کاملA Polynomial Kernel for Diamond-Free Editing
An H-free editing problem asks whether we can edit at most k edges to make a graph contain no induced copy of the fixed graph H. We obtain a polynomial kernel for this problem when H is a diamond. The incompressibility dichotomy for H being a 3-connected graph [4] and the classical complexity dichotomy [1] suggest that except for H being a complete/empty graph, Hfree editing problems admit poly...
متن کاملA Coloring Algorithm for $4K_1$-free line graphs
Let L be a set of graphs. Free(L) is the set of graphs that do not contain any graph in L as an induced subgraph. It is known that if L is a set of four-vertex graphs, then the complexity of the coloring problem for Free(L) is known with three exceptions: L = {claw, 4K1}, L = {claw, 4K1, co-diamond}, and L = {C4, 4K1}. In this paper, we study the coloring problem for Free(claw, 4K1). We solve t...
متن کاملThe edge-closure of a claw-free graph is the line graph of a multigraph
Ryjáček introduced a closure concept in claw-free graphs based on local completion at a locally connected vertex. He showed that the closure of a graph is the line graph of a triangle-free graph. Brousek and Holub gave an analogous closure concept of claw-free graphs, called the edge-closure, based on local completion at a locally connected edge. In this paper, it is shown that the edge-closure...
متن کاملEnsemble Kernel Learning Model for Prediction of Time Series Based on the Support Vector Regression and Meta Heuristic Search
In this paper, a method for predicting time series is presented. Time series prediction is a process which predicted future system values based on information obtained from past and present data points. Time series prediction models are widely used in various fields of engineering, economics, etc. The main purpose of using different models for time series prediction is to make the forecast with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1707.06779 شماره
صفحات -
تاریخ انتشار 2017