Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth.
Hasna Mohsen AlqahtaniThomas ErlebachPublished in: SOFSEM (2014)
Keyphrases
- disjoint paths
- bounded treewidth
- undirected graph
- minimum cost
- np complete
- directed graph
- approximation algorithms
- np hard
- spanning tree
- decision problems
- highly parallelizable
- finding the shortest path
- conjunctive queries
- relational learning
- boolean functions
- directed acyclic graph
- database
- query evaluation
- constraint satisfaction problems
- random walk
- graph theoretic
- knowledge base
- social networks
- databases