Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization.
Guilherme de C. M. GomesIgnasi SauPublished in: Algorithmica (2021)
Keyphrases
- exact algorithms
- knapsack problem
- approximation algorithms
- exact solution
- worst case
- combinatorial problems
- computational problems
- space complexity
- heuristic methods
- computational complexity
- fixed parameter tractable
- bounded treewidth
- combinatorial optimization
- bounded degree
- combinatorial optimization problems
- graph theoretic
- max sat
- upper bound
- dynamic programming
- social networks