Results 21 to 30 of about 42,360 (298)
A Parameterized Approximation Algorithm for the Chromatic k-Median Problem
IEEE Access, 2021 Chromatic $k$ -median is a frequently encountered problem in the determination of the topological structures of chromosomes. This problem considers a set $\mathcal {C}$ of colored clients and a set $\mathcal {F}$ of facilities located in a metric ...
Zhen Zhang, Jinchuan Zhang, Lingzhi Zhu
doaj +1 more source
Subset Feedback Vertex Set Is Fixed-Parameter Tractable [PDF]
SIAM Journal on Discrete Mathematics, 2013 The classical Feedback Vertex Set problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. Feedback Vertex Set has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fixed-parameter algorithms have been a rich source of ...
Marek Cygan +3 more
openalex +4 more sources
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A mixed dominating set for a graph $G = (V,E)$ is a set $S\subseteq V \cup E$ such that every element $x \in (V \cup E) \backslash S$ is either adjacent or incident to an element of $S$. The mixed domination number of a graph $G$, denoted by $\gamma_m(G)$
M. Rajaati +3 more
doaj +1 more source
Imbalance is fixed parameter tractable [PDF]
Information Processing Letters, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lokshtanov, Daniel +2 more
openaire +2 more sources
On the Descriptive Complexity of Color Coding
Algorithms, 2021 Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
doaj +1 more source
Minimum Bisection Is Fixed-Parameter Tractable [PDF]
SIAM Journal on Computing, 2014 In the classic Minimum Bisection problem we are given as input a graph $G$ and an integer $k$. The task is to determine whether there is a partition of $V(G)$ into two parts $A$ and $B$ such that $||A|-|B|| \leq 1$ and there are at most $k$ edges with one endpoint in $A$ and the other in $B$.
Cygan, Marek +4 more
openaire +3 more sources
Distortion Is Fixed Parameter Tractable [PDF]
ACM Transactions on Computation Theory, 2009 We study low-distortion embedding of metric spaces into the line, and more generally, into the shortest path metric of trees, from the parameterized complexity perspective. Let M = M ( G ) be the shortest path metric of an edge-weighted graph G ,
Michael Fellows +5 more
openaire +1 more source
Finding Detours is Fixed-Parameter Tractable [PDF]
SIAM Journal on Discrete Mathematics, 2019 Extended abstract appears at ICALP ...
Ivona Bezáková +3 more
openaire +6 more sources
Interval Deletion Is Fixed-Parameter Tractable [PDF]
ACM Transactions on Algorithms, 2013 We study the minimum interval deletion problem, which asks for the removal of a set of at most k vertices to make a graph of n vertices into an interval graph. We present a parameterized algorithm of runtime 10 k ⋅ n
Cao, Y., Marx, Dániel
openaire +4 more sources
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 ...
Cleary, Sean, John, Katherine St.
openaire +3 more sources