Results 21 to 30 of about 2,616,817 (282)
Rotation distance is fixed-parameter tractable [PDF]
Information Processing Letters, 2009 Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we show that the rotation distance between two ordered trees is fixed-parameter tractable, in the parameter, k, the ...
Sean Cleary, Katherine St. John
openaire +4 more sources
Interval Completion Is Fixed Parameter Tractable [PDF]
SIAM Journal on Computing, 2009 We present an algorithm with runtime $O(k^{2k}n^3m)$ for the following NP-complete problem: Given an arbitrary graph $G$ on $n$ vertices and $m$ edges, can we obtain an interval graph by adding at most $k$ new edges to $G$? This resolves the long-standing open question, first posed by Kaplan, Shamir and Tarjan, of whether this problem could be solved ...
Yngve Villanger +3 more
openaire +2 more sources
Jungles, bundles, and fixed-parameter tractability [PDF]
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013 The new version contains simplified proofs providing better running times of the algorithms, as well as a wider discussion of the ...
Fedor V. Fomin, Michal Pilipczuk
openaire +4 more sources
Optimal Discretization is Fixed-parameter Tractable [PDF]
, 2021 Given two disjoint sets $W_1$ and $W_2$ of points in the plane, the Optimal Discretization problem asks for the minimum size of a family of horizontal and vertical lines that separate $W_1$ from $W_2$, that is, in every region into which the lines partition the plane there are either only points of $W_1$, or only points of $W_2$, or the region is empty.
Stefan Kratsch +4 more
openaire +4 more sources
Chordal Editing is Fixed-Parameter Tractable [PDF]
Algorithmica, 2015 Graph modification problems are typically asked as follows: is there a small set of operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and edge addition; for the same property, one can define significantly different versions by allowing different ...
Yixin Cao 0001, Dániel Marx
openaire +7 more sources
05301 Abstracts Collection – Exact Algorithms and Fixed-Parameter Tractability [PDF]
, 2006 From 24.07.05 to 29.07.05, the Dagstuhl Seminar 05301 ``Exact Algorithms and Fixed-Parameter Tractability'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Woeginger, Gerhard +2 more
core +1 more source
05301 Summary – Exact Algorithms and Fixed-Parameter Tractability [PDF]
, 2006 Summary of the Dagstuhl Seminar held 24. July - 29.
Woeginger, Gerhard +2 more
core +1 more source
Chordal Deletion is Fixed-Parameter Tractable [PDF]
Algorithmica, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Fixed-Parameter Tractability of Some Routing Problems
, 2002 Disjoint Paths is the problem of finding paths between given pairs of terminals in a graph such that no vertices are shared between paths. We analyze fixed-parameter tractability of several new Disjoint Paths-like routing problems motivated by ...
Slivkins, Aleksandrs, Pal, Martin
core +6 more sources
Vertex Cover Reconfiguration and Beyond
Algorithms, 2018 In the Vertex Cover Reconfiguration (VCR) problem, given a graph G, positive integers k and ℓ and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most ℓ vertex additions or removals ...
Amer E. Mouawad +3 more
doaj +1 more source