Results 11 to 20 of about 42,360 (298)
Minimizing movement: Fixed-parameter tractability [PDF]
ACM Transactions on Algorithms, 2014 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 ...
Demaine, Erik D. +2 more
core +9 more sources
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2015 The Multicut problem, given a graph G, a set of terminal pairs $\mathcal{T}=\{(s_i,t_i)\ |\ 1\leq i\leq r\}$, and an integer $p$, asks whether one can find a cutset consisting of at most $p$ nonterminal vertices that separates all the terminal pairs, i.e.
Bousquet N. +8 more
core +10 more sources
Directed Feedback Vertex Set is Fixed-Parameter Tractable [PDF]
, 2007 We resolve positively a long standing open question regarding the fixed-parameter tractability of the parameterized Directed Feedback Vertex Set problem.
Igor Razgon, Barry O’Sullivan
openalex +5 more sources
Fixed-parameter tractability, definability, and model checking [PDF]
SIAM Journal on Computing, 2001 In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order logic as ...
Flum, Joerg, Grohe, Martin
core +4 more sources
Fixed-Parameter Tractability and Completeness I: Basic Results [PDF]
SIAM Journal on Computing, 1995 Summary: For many fixed-parameter problems that are trivially solvable in polynomial time, such as \((k)\)-DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as \((k)\)-FEEDBACK VERTEX SET, exhibit fixed-parameter tractability: for each fixed \(k\) the problem is ...
Downey, Rod G., Fellows, Michael R.
openaire +3 more sources
Unit Interval Editing is Fixed-Parameter Tractable [PDF]
Information and Computation, 2016 Given a graph~$G$ and integers $k_1$, $k_2$, and~$k_3$, the unit interval editing problem asks whether $G$ can be transformed into a unit interval graph by at most $k_1$ vertex deletions, $k_2$ edge deletions, and $k_3$ edge additions.
D Marx +12 more
core +3 more sources
A hybrid framework of hesitant fuzzy soft sets and rough sets for uncertainty modelling [PDF]
Scientific ReportsThe process of decision making involves uncertainty due to lack of agreement among experts, inaccuracy in measurements and incomplete information.
Jahanvi +3 more
doaj +2 more sources
Hitting Long Directed Cycles Is Fixed-Parameter Tractable [PDF]
, 2020 In the Directed Long Cycle Hitting Set} problem we are given a directed graph $G$, and the task is to find a set $S$ of at most $k$ vertices/arcs such that $G-S$ has no cycle of length longer than $\ell$. We show that the problem can be solved in time $2^{\mathcal O(\ell k^3\log k + k^5\log k\log\ell)}\cdot n^{\mathcal O(1)}$, that is, it is fixed ...
Alexander Göke +2 more
+9 more sources
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable [PDF]
, 2023 The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for fundamental representations such as planar and beyond-planar topological drawings.
Sujoy Bhore +4 more
openalex +5 more sources
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs.
Hanna Furmańczyk, Vahan Mkrtchyan
doaj +1 more source