Distributed algorithms for computing shortest pairs of disjoint paths.

Richard G. Ogier Vladislav Rutenburg Nachum Shacham

Published in: IEEE Trans. Inf. Theory (1993)

Keyphrases

computationally efficient
multi agent
neural network
machine learning
lower bound
pairwise
significant improvement
computational cost
benchmark datasets
times faster
learning algorithm
cooperative
shortest path
gray scale
computational efficiency
disjoint paths