Efficient Distributed Algorithms for Computing Shortest Pairs of Maximally Disjoint Paths in Communication Networks

Vladislav Rutenburg. Efficient Distributed Algorithms for Computing Shortest Pairs of Maximally Disjoint Paths in Communication Networks. In INFOCOM. pages 1214-1219, 1991.

Authors

Vladislav Rutenburg

This author has not been identified. Look up 'Vladislav Rutenburg' in Google