Results 1 to 10 of about 21,066 (118)
Optimal Complexity of Parameterized Quantum Circuits [PDF]
Parameterized quantum circuits are central to the development of variational quantum algorithms in the NISQ era. A key feature of these circuits is their ability to generate an expressive set of quantum states, enabling the approximation of solutions to ...
Guilherme I. Correr +3 more
doaj +2 more sources
On the parameterized complexity of the median and closest problems under some permutation metrics [PDF]
Genome rearrangements are events where large blocks of DNA exchange places during evolution. The analysis of these events is a promising tool for understanding evolutionary genomics, providing data for phylogenetic reconstruction based on genome ...
Luís Cunha, Ignasi Sau, Uéverton Souza
doaj +2 more sources
Parameterized Complexity of Geodetic Set
A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb{N}$, the NP-hard ${\rm G{\small EODETIC}~S{ \small ET}}$ problem asks whether there is a geodetic
Leon Kellerhals, Tomohiro Koana
doaj +1 more source
Parameterized Complexity of Equitable Coloring [PDF]
A graph on $n$ vertices is equitably $k$-colorable if it is $k$-colorable and every color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k \right\rceil$ times.
Guilherme de C. M. Gomes +2 more
doaj +1 more source
In this paper, we study the relationship of parameterized enumeration complexity classes defined by Creignou et al. (MFCS 2013). Specifically, we introduce two hierarchies (IncFPTa and CapIncFPTa) of enumeration complexity classes for incremental fpt ...
Arne Meier
doaj +1 more source
Parameterized Complexity of Safe Set
In this paper we study the problem of finding a small safe set $S$ in a graph $G$, i.e., a non-empty set of vertices such that no connected component of $G[S]$ is adjacent to a larger component in $G - S$. We enhance our understanding of the problem from
Rémy Belmonte +5 more
doaj +1 more source
Parameterized complexity of synchronization and road coloring [PDF]
Automata, Logic and ...
Vojtěch Vorel, Adam Roman
doaj +1 more source
The parameterized space complexity of model-checking bounded variable first-order logic [PDF]
The parameterized model-checking problem for a class of first-order sentences (queries) asks to decide whether a given sentence from the class holds true in a given relational structure (database); the parameter is the length of the sentence.
Yijia Chen +2 more
doaj +1 more source
Parameterized Algorithms for Queue Layouts
An $h$-queue layout of a graph $G$ consists of a linear order of its vertices and a partition of its edges into $h$ sets, called queues, such that no two independent edges of the same queue nest.
Sujoy Bhore +3 more
doaj +1 more source
Parameterized Complexity of 1-Planarity
We consider the problem of drawing graphs with at most one crossing per edge. These drawings, and the graphs that can be drawn in this way, are called $1$-planar.
Michael Bannister +2 more
doaj +1 more source

