Results 41 to 50 of about 1,864,097 (296)
How Bad is the Freedom to Flood-It?
${\rm F{\small IXED-}F{\small LOOD-}I{\small T}}$ and ${\rm F{\small REE-}F{\small LOOD-}I{\small T}}$ are combinatorial problems on graphs that generalize a very popular puzzle called Flood-It. Both problems consist of recoloring moves whose goal is to
Rémy Belmonte +4 more
doaj +1 more source
Order Reconfiguration under Width Constraints
In this work, we consider the following order reconfiguration problem: Given a graph $G$ together with linear orders $\omega$ and $\omega'$ of the vertices of $G$, can one transform $\omega$ into $\omega'$ by a sequence of swaps of adjacent elements in ...
Emmanuel Arrighi +3 more
doaj +1 more source
09511 Abstracts Collection – Parameterized complexity and approximation algorithms [PDF]
From 14. 12. 2009 to 17. 12. 2009., the Dagstuhl Seminar 09511 ``Parameterized complexity and approximation algorithms '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
Marx, Dániel +2 more
core +1 more source
The Parameterized Complexity of Positional Games [PDF]
To appear in the Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Édouard Bonnet +4 more
openaire +6 more sources
Relativization and Interactive Proof Systems in Parameterized Complexity Theory [PDF]
We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized complexity classes ...
Bottesch, Ralph, Bottesch, R.C. (Ralph)
core +1 more source
Parameterized Complexity of Superstring Problems [PDF]
In the Shortest Superstring problem we are given a set of strings $S=\{s_1, \ldots, s_n\}$ and integer $\ell$ and the question is to decide whether there is a superstring $s$ of length at most $\ell$ containing all strings of $S$ as substrings. We obtain several parameterized algorithms and complexity results for this problem. In particular, we give an
Ivan Bliznets +5 more
openaire +3 more sources
On the Parameterized Complexity of Polytree Learning [PDF]
A Bayesian network is a directed acyclic graph that represents statistical dependencies between variables of a joint probability distribution. A fundamental task in data science is to learn a Bayesian network from observed data. Polytree Learning is the problem of learning an optimal Bayesian network that fulfills the additional property that its ...
Niels Grüttemeier +2 more
openaire +4 more sources
Parameterized streaming : maximal matching and vertex cover [PDF]
As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh; id_orcid +11 more
core +1 more source
Parameterized Complexity of a Parallel Machine Scheduling Problem [PDF]
In this paper we consider the parameterized complexity of two versions of a parallel machine scheduling problem with precedence delays, unit processing times and time windows.
Munier-Kordon, Alix +2 more
core +1 more source
Parameterized Complexity of Graph Burning
Abstract Graph Burning asks, given a graph $$G = (V,E)$$ G ...
Yasuaki Kobayashi, Yota Otachi
openaire +6 more sources

