Results 1 to 10 of about 150,456 (276)
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 +2 more
doaj +6 more sources
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Logical Methods in Computer Science, 2005 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
Parameterized Complexity of Directed Spanner Problems. [PDF]
Algorithmica, 2022 AbstractWe initiate the parameterized complexity study of minimum t-spanner problems on directed graphs. For a positive integer t, a multiplicative t-spanner of a (directed) graph G is a spanning subgraph H such that the distance between any two vertices in H is at most t times the distance between these vertices in G, that is, H keeps the distances in
Fomin FV +5 more
europepmc +12 more sources
Optimal Complexity of Parameterized Quantum Circuits [PDF]
EntropyParameterized 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
The parameterized space complexity of model-checking bounded variable first-order logic [PDF]
Logical Methods in Computer Science, 2019 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
Parameterized Complexity Dichotomy for Steiner Multicut [PDF]
Journal of Computer and System Sciences, 2014 The Steiner Multicut problem asks, given an undirected graph G, terminals sets T1,...,Tt $\subseteq$ V(G) of size at most p, and an integer k, whether there is a set S of at most k edges or nodes s.t.
Bringmann, Karl +3 more
core +11 more sources
Parameterized Complexity of Eulerian Deletion Problems. [PDF]
Algorithmica, 2014 We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge deletions, with or without the requirement of connectivity, etc.
Cygan M +4 more
europepmc +10 more sources
On the parameterized complexity of the median and closest problems under some permutation metrics [PDF]
Algorithms for Molecular BiologyGenome 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]
SensorsDrone-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
Parameterized Proof Complexity [PDF]
computational complexity, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dantchev, S., Martin, B., Szeider, S.
openaire +2 more sources