On Routing Disjoint Paths in Bounded Treewidth Graphs.
Alina EneMatthias MnichMarcin PilipczukAndrej RisteskiPublished in: CoRR (2015)
Keyphrases
- bounded treewidth
- disjoint paths
- np complete
- decision problems
- directed graph
- undirected graph
- boolean functions
- conjunctive queries
- highly parallelizable
- relational learning
- approximation algorithms
- complex networks
- np hard
- databases
- social network analysis
- background knowledge
- shortest path
- random walk
- domain knowledge
- graph theoretic
- computational complexity
- fixed parameter tractable
- bayesian networks
- database systems