Results 11 to 20 of about 149,306 (281)
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 +15 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
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
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
On the Descriptive Complexity of Color Coding
Algorithms, 2021 Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
doaj +1 more source
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 +4 more sources
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 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 +1 more source
Quantum Parameterized Complexity
, 2022 23 pages, 1 ...
Bremner, Michael J. +5 more
openaire +2 more sources