Results 1 to 10 of about 149,306 (281)
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 +6 more sources
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj +4 more sources
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 +6 more sources
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
Enhancing UAV Object Detection in Low-Light Conditions with ELS-YOLO: A Lightweight Model Based on Improved YOLOv11 [PDF]
Drone-view object detection models operating under low-light conditions face several challenges, such as object scale variations, high image noise, and limited computational resources.
Tianhang Weng, Xiaopeng Niu
doaj +2 more sources
New Algorithms for Mixed Dominating Set [PDF]
A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 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
Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective
The clique transversal problem and its variants have garnered significant attention in the last two decades due to their practical applications in communication networks, social-network theory and transceiver placement for cellular telephones.
Chuan-Min Lee
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

