Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs.
Siqian ShenJ. Cole SmithPublished in: Networks (2012)
Keyphrases
- series parallel
- binary trees
- redundancy allocation
- convex optimization problems
- optimization problems
- combinatorial optimization
- graph theory
- polynomial time complexity
- artificial bee colony algorithm
- computational complexity
- tree decomposition
- np complete problems
- np complete
- temporal reasoning
- hybrid algorithm
- constraint satisfaction
- special case