The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable.
Marek CyganDániel MarxMarcin PilipczukMichal PilipczukPublished in: FOCS (2013)
Keyphrases
- disjoint paths
- fixed parameter tractable
- undirected graph
- vertex set
- parameterized complexity
- directed graph
- np hard
- approximation algorithms
- computational problems
- np complete
- minimum cost
- graph structure
- directed acyclic graph
- global constraints
- connected components
- spanning tree
- complex networks
- bounded treewidth
- random walk
- conjunctive queries
- random graphs
- lower bound
- upper bound