Results 21 to 30 of about 23,779 (205)
Parameterized Complexity of Broadcasting in Graphs
Theoretical Computer Science, 2023 The task of the broadcast problem is, given a graph G and a source vertex s, to compute the minimum number of rounds required to disseminate a piece of information from s to all vertices in the graph. It is assumed that, at each round, an informed vertex can transmit the information to at most one of its neighbors.
Fomin, Fedor +2 more
openaire +5 more sources
Parameterized Complexity of Gerrymandering
, 2023 In a representative democracy, the electoral process involves partitioning geographical space into districts which each elect a single representative. These representatives craft and vote on legislation, incentivizing political parties to win as many districts as possible (ideally a plurality). Gerrymandering is the process by which district boundaries
Andrew Fraser +2 more
openaire +2 more sources
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 +2 more sources
Parameterized complexity of conflict-free graph coloring [PDF]
, 2021 Given a graph G, a q-open neighborhood confict-free coloring or q-ONCF-coloring is a vertex coloring c: V (G) {1, 2,..., q} such that for each vertex ν V (G) there is a vertex in N(v) that is uniquely colored from the rest of the vertices in N(ν).
Pieterse, Astrid +2 more
core +2 more sources
Parameterized learning complexity [PDF]
Proceedings of the sixth annual conference on Computational learning theory - COLT '93, 1993 We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using parameterized problem reducibilities, we show that P -sized DNF (CNF) formulas can be exactly learned in time polynomial in the number of variables by extended equivalence queries ...
Rodney G. Downey +2 more
openaire +1 more source
Improving Vertex Cover as a Graph Parameter [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however,
Robert Ganian
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
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity [PDF]
, 2023 Recently, Brand, Ganian and Simonov introduced a parameterized refinement of the classical PAC-learning sample complexity framework. A crucial outcome of their investigation is that for a very wide range of learning problems, there is a direct and ...
Ganian, Robert +2 more
core +1 more source
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 +5 more sources
Parameterized Complexity of Perfectly Matched Sets [PDF]
, 2022 For an undirected graph G, a pair of vertex disjoint subsets (A, B) is a pair of perfectly matched sets if each vertex in A (resp. B) has exactly one neighbor in B (resp. A). In the above, the size of the pair is |A| (= |B|).
Agrawal, Akanksha +3 more
core +1 more source