A Distributed Algorithm for Finding Shortest Pairs of Disjoint Paths.
Richard G. OgierNachum ShachamPublished in: INFOCOM (1989)
Keyphrases
- detection algorithm
- learning algorithm
- times faster
- recognition algorithm
- computational complexity
- k means
- experimental evaluation
- improved algorithm
- preprocessing
- convergence rate
- significant improvement
- optimization algorithm
- dynamic programming
- optimal solution
- worst case
- expectation maximization
- input data
- computational cost
- cost function
- path length
- spanning tree
- disjoint paths
- neural network
- candidate pairs
- clustering method
- theoretical analysis
- particle swarm optimization
- high accuracy
- pairwise
- multi agent
- objective function