The edge-disjoint paths problem is NP-complete for series-parallel graphs.
Takao NishizekiJens VygenXiao ZhouPublished in: Discret. Appl. Math. (2001)
Keyphrases
- series parallel
- disjoint paths
- np complete
- approximation algorithms
- np hard
- precedence constraints
- directed graph
- undirected graph
- temporal reasoning
- polynomial time complexity
- conjunctive queries
- constraint satisfaction problems
- tree decomposition
- computational complexity
- worst case
- scheduling problem
- redundancy allocation
- binary images
- upper bound
- minimum cost