Results 1 to 10 of about 128,668 (237)
Parameterized Complexity of Edge Interdiction Problems [PDF]
, 2014 We study the parameterized complexity of interdiction problems in graphs. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who compete on an ...
Guo, Jiong, Shrestha, Yash Raj
core +1 more source
The Burning Number of Directed Graphs: Bounds and Computational Complexity
Theory and Applications of Graphs, 2020 The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalizes naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for directed graphs,
Remie Janssen
doaj +1 more source
Paradigms for Parameterized Enumeration [PDF]
, 2013 The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity.
D. Marx +7 more
core +2 more sources
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 +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
The Parameterized Complexity of Positional Games [PDF]
, 2017 To appear in the Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Bonnet, Edouard +4 more
openaire +5 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
Describing Parameterized Complexity Classes
Information and Computation, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Flum, Jörg, Grohe, Martin
openaire +5 more sources
Parameterized Complexity of Graph Burning
Algorithmica, 2022 AbstractGraph Burning asks, given a graph $$G = (V,E)$$ G = ( V , E ) and an integer k, whether there exists $$(b_{0},\dots ,b_{k-1}) \in V^{k}$$
Yasuaki Kobayashi, Yota Otachi
openaire +6 more sources
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