4,526 research outputs found
Unit Interval Editing is Fixed-Parameter Tractable
Given a graph~ and integers , , and~, the unit interval
editing problem asks whether can be transformed into a unit interval graph
by at most vertex deletions, edge deletions, and edge
additions. We give an algorithm solving this problem in time , where , and denote respectively
the numbers of vertices and edges of . Therefore, it is fixed-parameter
tractable parameterized by the total number of allowed operations.
Our algorithm implies the fixed-parameter tractability of the unit interval
edge deletion problem, for which we also present a more efficient algorithm
running in time . Another result is an -time algorithm for the unit interval vertex deletion problem,
significantly improving the algorithm of van 't Hof and Villanger, which runs
in time .Comment: An extended abstract of this paper has appeared in the proceedings of
ICALP 2015. Update: The proof of Lemma 4.2 has been completely rewritten; an
appendix is provided for a brief overview of related graph classe
Structural parameterizations for boxicity
The boxicity of a graph is the least integer such that has an
intersection model of axis-aligned -dimensional boxes. Boxicity, the problem
of deciding whether a given graph has boxicity at most , is NP-complete
for every fixed . We show that boxicity is fixed-parameter tractable
when parameterized by the cluster vertex deletion number of the input graph.
This generalizes the result of Adiga et al., that boxicity is fixed-parameter
tractable in the vertex cover number.
Moreover, we show that boxicity admits an additive -approximation when
parameterized by the pathwidth of the input graph.
Finally, we provide evidence in favor of a conjecture of Adiga et al. that
boxicity remains NP-complete when parameterized by the treewidth.Comment: 19 page
An FPT algorithm and a polynomial kernel for Linear Rankwidth-1 Vertex Deletion
Linear rankwidth is a linearized variant of rankwidth, introduced by Oum and
Seymour [Approximating clique-width and branch-width. J. Combin. Theory Ser. B,
96(4):514--528, 2006]. Motivated from recent development on graph modification
problems regarding classes of graphs of bounded treewidth or pathwidth, we
study the Linear Rankwidth-1 Vertex Deletion problem (shortly, LRW1-Vertex
Deletion). In the LRW1-Vertex Deletion problem, given an -vertex graph
and a positive integer , we want to decide whether there is a set of at most
vertices whose removal turns into a graph of linear rankwidth at most
and find such a vertex set if one exists. While the meta-theorem of
Courcelle, Makowsky, and Rotics implies that LRW1-Vertex Deletion can be solved
in time for some function , it is not clear whether this
problem allows a running time with a modest exponential function.
We first establish that LRW1-Vertex Deletion can be solved in time . The major obstacle to this end is how to handle a long
induced cycle as an obstruction. To fix this issue, we define necklace graphs
and investigate their structural properties. Later, we reduce the polynomial
factor by refining the trivial branching step based on a cliquewidth expression
of a graph, and obtain an algorithm that runs in time . We also prove that the running time cannot be improved to under the Exponential Time Hypothesis assumption. Lastly,
we show that the LRW1-Vertex Deletion problem admits a polynomial kernel.Comment: 29 pages, 9 figures, An extended abstract appeared in IPEC201
Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes
Many fixed-parameter tractable algorithms using a bounded search tree have
been repeatedly improved, often by describing a larger number of branching
rules involving an increasingly complex case analysis. We introduce a novel and
general search strategy that branches on the forbidden subgraphs of a graph
class relaxation. By using the class of -sparse graphs as the relaxed
graph class, we obtain efficient bounded search tree algorithms for several
parameterized deletion problems. We give the first non-trivial bounded search
tree algorithms for the cograph edge-deletion problem and the trivially perfect
edge-deletion problems. For the cograph vertex deletion problem, a refined
analysis of the runtime of our simple bounded search algorithm gives a faster
exponential factor than those algorithms designed with the help of complicated
case distinctions and non-trivial running time analysis [21] and computer-aided
branching rules [11].Comment: 23 pages. Accepted in Discrete Mathematics, Algorithms and
Applications (DMAA
- …