Results 21 to 30 of about 2,051,541 (361)
On the parameterized complexity of computing tree-partitions [PDF]
International Symposium on Parameterized and Exact Computation, 2022 We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
H. Bodlaender +2 more
semanticscholar +1 more source
The Parameterized Complexity of Quantum Verification [PDF]
Theory of Quantum Computation, Communication, and Cryptography, 2022 We initiate the study of parameterized complexity of $\textsf{QMA}$ problems in terms of the number of non-Clifford gates in the problem description. We show that for the problem of parameterized quantum circuit satisfiability, there exists a classical ...
Srinivasan Arunachalam +3 more
semanticscholar +1 more source
Parameterized Complexity of Discrete Morse Theory [PDF]
ACM Transactions on Mathematical Software, 2016 Optimal Morse matchings reveal essential structures of cell complexes that lead to powerful tools to study discrete geometrical objects, in particular, discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on 3-manifolds through a reduction to the erasability problem.
Benjamin A. Burton +3 more
openalex +5 more sources
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems [PDF]
arXiv.org, 2022 A graph vertex-subset problem defines which subsets of the vertices of an input graph are feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of the graph.
N. Bousquet +3 more
semanticscholar +1 more source
Parameterized Complexity and Inapproximability of Dominating Set Problem in Chordal and Near Chordal Graphs. [PDF]
J Comb Optim, 2010 Liu C, Song Y.
europepmc +3 more sources
On the Parameterized Complexity of the Acyclic Matching Problem [PDF]
Theoretical Computer Science, 2021 A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic.
Sahab Hajebi, R. Javadi
semanticscholar +1 more source
Parameterized Complexity of Diameter [PDF]
Algorithmica, 2018 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
Matthias Bentert, André Nichterlein
openalex +5 more sources
Parameterized Complexity of Geodetic Set
Journal of Graph Algorithms and Applications, 2022 A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb{N}$, the NP-hard ${\rm G{\small EODETIC}~S{ \small ET}}$ problem asks whether there is a geodetic set of size at most $k$.
Leon Kellerhals, Tomohiro Koana
openalex +5 more sources
On the Parameterized Complexity of Learning First-Order Logic [PDF]
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2021 We analyse the complexity of learning first-order queries in a model-theoretic framework for supervised learning introduced by (Grohe and Turán, TOCS 2004).
Steffen van Bergerem +2 more
semanticscholar +1 more source
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