A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface.
Vincent Cohen-AddadArnaud de MesmayPublished in: CoRR (2015)
Keyphrases
- fixed parameter tractable
- vertex set
- parameterized complexity
- dynamic programming
- worst case
- bounded treewidth
- directed acyclic graph
- np complete
- connected components
- approximation algorithms
- graph theory
- directed graph
- weighted graph
- np hard
- search algorithm
- database
- query language
- graph theoretic
- optimal solution
- database systems