A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks.
Rachid HadidMehmet Hakan KaraataVincent VillainPublished in: Int. J. Found. Comput. Sci. (2017)
Keyphrases
- times faster
- experimental evaluation
- np hard
- computational complexity
- k means
- tree structure
- optimal solution
- search space
- cost function
- learning algorithm
- dynamic programming
- disjoint paths
- path length
- convergence rate
- detection algorithm
- optimization algorithm
- segmentation algorithm
- particle swarm optimization
- computational cost
- significant improvement
- objective function
- similarity measure
- social networks
- matching algorithm
- decision trees