Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width.
Hasna Mohsen AlqahtaniThomas ErlebachPublished in: IWOCA (2015)
Keyphrases
- disjoint paths
- undirected graph
- minimum cost
- directed graph
- approximation algorithms
- spanning tree
- bounded tree width
- np hard
- tree width
- expressive power
- directed acyclic graph
- graph structure
- connected components
- first order logic
- random walk
- worst case
- parallel processing
- graph theory
- tree decomposition
- special case