Planar Disjoint Paths, Treewidth, and Kernels.
Michal WlodarczykMeirav ZehaviPublished in: CoRR (2023)
Keyphrases
- disjoint paths
- approximation algorithms
- upper bound
- directed graph
- kernel function
- bounded treewidth
- search space
- boolean functions
- space complexity
- support vector
- kernel methods
- undirected graph
- feature space
- np complete
- tree decompositions
- planar surfaces
- linear combination
- minimum cost
- reproducing kernel hilbert space
- computational complexity
- image processing