Linear-time computability of combinatorial problems on series-parallel graphs.
K. TakamizawaTakao NishizekiNobuji SaitoPublished in: J. ACM (1982)
Keyphrases
- series parallel
- combinatorial problems
- constraint programming
- constraint satisfaction problems
- branch and bound algorithm
- precedence constraints
- graph coloring
- combinatorial optimization
- metaheuristic
- constraint satisfaction
- tree decomposition
- phase transition
- traveling salesman problem
- temporal reasoning
- global constraints
- constraint networks
- redundancy allocation
- constraint propagation
- optimal solution
- integer programming
- optimization algorithm
- simulated annealing
- lower bound
- arc consistency
- qualitative and quantitative
- network design
- worst case
- genetic algorithm