A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths.
Chris CalabroPublished in: Electron. Colloquium Comput. Complex. (2008)
Keyphrases
- series parallel
- lower bound
- precedence constraints
- temporal reasoning
- upper bound
- branch and bound algorithm
- tree decomposition
- binary trees
- branch and bound
- objective function
- network design
- shortest path
- computational complexity
- redundancy allocation
- constraint networks
- np hard
- worst case
- space complexity
- scheduling problem
- optimal solution
- genetic algorithm