Results 11 to 20 of about 4,614 (253)
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 +2 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 +3 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
Minimizing Movement: Fixed-Parameter Tractability [PDF]
ACM Transactions on Algorithms, 2009 We study an extensive class of movement minimization problems that arise from many practical scenarios but so far have little theoretical study. In general, these problems involve planning the coordinated motion of a collection of agents (representing robots, people, map labels, network messages, etc.) to achieve a global property in the network while ...
Erik D. Demaine +2 more
openaire +5 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 +5 more sources
Computing L(p,1)-Labeling with Combined Parameters
Journal of Graph Algorithms and Applications, 2022 Given a graph, an $L(p,1)$-labeling of the graph is an assignment $f$ from the vertex set to the set of nonnegative integers such that for any pair of vertices $u$ and $v$, $|f (u) - f (v)| \ge p$ if $u$ and $v$ are adjacent, and $f(u) \neq f(v)$ if $u ...
Tesshu Hanaka +2 more
doaj +1 more source
Practical Access to Dynamic Programming on Tree Decompositions
Algorithms, 2019 Parameterized complexity theory has led to a wide range of algorithmic breakthroughs within the last few decades, but the practicability of these methods for real-world problems is still not well understood.
Max Bannach, Sebastian Berndt
doaj +1 more source
Phylogenetic incongruence through the lens of Monadic Second Order logic
Journal of Graph Algorithms and Applications, 2016 Within the field of phylogenetics there is growing interest in measures for summarising the dissimilarity, or incongruence, of two or more phylogenetic trees. Many of these measures are NP-hard to compute and this has stimulated a considerable volume of
Steven Kelk +3 more
doaj +1 more source
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Journal of Graph Algorithms and Applications, 2018 We investigate crossing minimization for $1$-page and $2$-page book drawings. We show that computing the $1$-page crossing number is fixed-parameter tractable with respect to the number of crossings, that testing $2$-page planarity is fixed-parameter ...
Michael Bannister, David Eppstein
doaj +1 more source
Graph Motif Problems Parameterized by Dual
Journal of Graph Algorithms and Applications, 2020 Let $G=(V,E)$ be a vertex-colored graph, where $C$ is the set of colors used to color $V$. The ${\rm G{\small RAPH}~M{\small OTIF}}$ (or $\rm GM$) problem takes as input $G$, a multiset $M$ of colors built from $C$, and asks whether there is a ...
Guillaume Fertin, Christian Komusiewicz
doaj +1 more source