Results 21 to 30 of about 1,615,193 (298)
Parameterized complexity of synchronization and road coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Automata, Logic and ...
Vojtěch Vorel, Adam Roman
doaj +1 more source
New Algorithms for Mixed Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 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 reconfiguration of atoms
Algorithmica, 2022 Abstract Our work is motivated by the challenges presented in preparing arrays of atoms for use in quantum simulation. The recently-developed process of loading atoms into traps results in approximately half of the traps being filled. To consolidate the atoms so that they form a dense and regular arrangement, such as all locations in a grid ...
Alexandre Cooper +3 more
openaire +4 more sources
Parameterized Algorithms for Queue Layouts
Journal of Graph Algorithms and Applications, 2022 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 parallel complexity [PDF]
, 1998 We introduce a framework to study the parallel complexity of parameterized problems, and we propose some analogs of NC.
Cesati M., Di Ianni M.
openaire +4 more sources
On the Parameterized Complexity of Compact Set Packing. [PDF]
Algorithmica, 2023 AbstractThe Set Packing problem is, given a collection of sets $$\mathcal {S}$$ S over a ground set U, to find a maximum collection of sets that are pairwise disjoint. The problem is among the most fundamental NP-hard optimization problems that have been studied extensively in various computational regimes.
Gadekar A.
europepmc +7 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 +1 more source
Parameterized complexity of firefighting
Journal of Computer and System Sciences, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cristina Bazgan +5 more
openaire +4 more sources
Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective
Mathematics, 2023 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
Parameterized Complexity of Graph Burning [PDF]
, 2020 Graph Burning asks, given a graph G = (V,E) and an integer k, whether there exists (b₀,… ,b_{k-1}) ∈ V^{k} such that every vertex in G has distance at most i from some b_i. This problem is known to be NP-complete even on connected caterpillars of maximum
Otachi, Yota, Kobayashi, Yasuaki
core +1 more source