Results 61 to 70 of about 2,051,541 (361)
Parameterized Complexity of 1-Planarity [PDF]
Journal of Graph Algorithms and Applications, 2013 We consider the problem of drawing graphs with at most one crossing per edge. These drawings, and the graphs that can be drawn in this way, are called $1$-planar. Finding $1$-planar drawings is known to be ${\mathsf{NP}}$-hard, but we prove that it is fixed-parameter tractable with respect to the vertex cover number, tree-depth, and cyclomatic number ...
Bannister, Michael J. +2 more
openaire +3 more sources
The Complexity of Reachability in Affine Vector Addition Systems with States [PDF]
Logical Methods in Computer Science, 2021 Vector addition systems with states (VASS) are widely used for the formal verification of concurrent systems. Given their tremendous computational complexity, practical approaches have relied on techniques such as reachability relaxations, e.g., allowing
Michael Blondin, Mikhail Raskin
doaj +1 more source
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis [PDF]
International Joint Conference on Artificial Intelligence, 2020 We study the problem of learning the structure of an optimal Bayesian network when additional structural constraints are posed on the network or on its moralized graph.
Niels Grüttemeier +1 more
semanticscholar +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 +2 more sources
Treewidth-based algorithms for the small parsimony problem on networks
Algorithms for Molecular Biology, 2022 Background Phylogenetic reconstruction is one of the paramount challenges of contemporary bioinformatics. A subtask of existing tree reconstruction algorithms is modeled by the Small Parsimony problem: given a tree T and an assignment of character-states
Celine Scornavacca, Mathias Weller
doaj +1 more source
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
AAAI Conference on Artificial Intelligence, 2020 We consider the classical problem of allocating resources among agents in an envy-free (and, where applicable, proportional) way. Recently, the basic model was enriched by introducing the concept of a social network which allows to capture situations ...
E. Eiben +3 more
semanticscholar +1 more source
On the parameterized complexity of approximating dominating set [PDF]
Electron. Colloquium Comput. Complex., 2017 We study the parameterized complexity of approximating the k-Dominating Set (domset) problem where an integer k and a graph G on n vertices are given as input, and the goal is to find a dominating set of size at most F(k) · k whenever the graph G has a ...
S. KarthikC. +2 more
semanticscholar +1 more source
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Algorithms, 2019 Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science.
Robert Ganian, Sebastian Ordyniak
doaj +1 more source
Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue
Algorithms, 2016 We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015.
Henning Fernau
doaj +1 more source
Completeness Results for Parameterized Space Classes
, 2013 The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy.
C.M.R. Kintala +10 more
core +1 more source