Results 11 to 20 of about 1,615,193 (298)
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. [PDF]
AlgorithmicaIn this paper, we study the Eulerian Strong Component Arc Deletion problem, where the input is a directed multigraph and the goal is to delete the minimum number of arcs to ensure every strongly connected component of the resulting digraph is Eulerian.
Blažej V +3 more
europepmc +2 more sources
On the parameterized complexity of Grid Contraction
Journal of Computer and System Sciences, 2022 For a family of graphs $\mathcal{G}$, the $\mathcal{G}$-\textsc{Contraction} problem takes as an input a graph $G$ and an integer $k$, and the goal is to decide if there exists $F \subseteq E(G)$ of size at most $k$ such that $G/F$ belongs to $\mathcal{G}$. Here, $G/F$ is the graph obtained from $G$ by contracting all the edges in $F$. In this article,
Saket Saurabh 0001 +2 more
openaire +9 more sources
Parameterized Complexity of Diameter [PDF]
Algorithmica, 2019 AbstractDiameter—the task of computing the length of a longest shortest path—is a fundamental graph problem. Assuming the Strong Exponential Time Hypothesis, there is no $$O(n^{1.99})$$ O ( n 1.99
Bentert, Matthias, Nichterlein , André
openaire +6 more sources
Quantum Parameterized Complexity
CoRR, 2022 23 pages, 1 ...
Michael J. Bremner +5 more
openaire +2 more sources
Computing nash equilibria gets harder : new results show hardness even for parameterized complexity [PDF]
, 2009 In this paper we show that some decision problems regarding the computation of Nash equilibria are to be considered particularly hard. Most decision problems regarding Nash equilibria have been shown to be NP-complete. While some NP-complete problems can
Parsa, Mahdi, Estivill-Castro, Vladimir
core +3 more sources
Algorithms, 2020 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
Parameterized Complexity of Streaming Diameter and Connectivity Problems [PDF]
, 2022 We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the streaming paradigm. On the positive end, we show that knowing a vertex cover of size k allows for algorithms in the Adjacency List (AL) streaming model ...
van Leeuwen, Erik Jan +3 more
core +1 more source
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 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 +2 more sources
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 +7 more sources