Results 1 to 10 of about 1,615,193 (298)

Parameterized Complexity of Geodetic Set

Journal of Graph Algorithms and Applications, 2022
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   +7 more sources

Parameterized Complexity of Equitable Coloring [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
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, Carlos V. G. C. Lima, Vinícius F. dos Santos   +2 more
doaj   +6 more sources

Optimal Complexity of Parameterized Quantum Circuits [PDF]

Entropy
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, Pedro C. Azado, Diogo O. Soares-Pinto, Gabriel G. Carlo   +3 more
doaj   +2 more sources

Parameterized Complexity of Safe Set [PDF]

Journal of Graph Algorithms and Applications, 2020
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, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi   +5 more
doaj   +6 more sources

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

Algorithms, 2020
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results.
Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi   +3 more
doaj   +3 more sources

Describing Parameterized Complexity Classes [PDF]

Information and Computation, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jörg Flum, Martin Grohe
openaire   +6 more sources

Parameterized Complexity of 1-Planarity [PDF]

Journal of Graph Algorithms and Applications, 2018
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, Sergio Cabello, David Eppstein   +2 more
doaj   +6 more sources

On the parameterized complexity of the median and closest problems under some permutation metrics [PDF]

Algorithms for Molecular Biology
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 Scheduling Chains of Jobs with Delays [PDF]

, 2020
In this paper, we consider the parameterized complexity of the following scheduling problem. We must schedule a number of jobs on m machines, where each job has unit length, and the graph of precedence constraints consists of a set of chains.
Wegen, Marieke van der, van der Wegen, Marieke, Bodlaender, Hans L.   +2 more
core   +3 more sources

Parameterized Proof Complexity [PDF]

computational complexity, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider   +2 more
openaire   +2 more sources