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

Vladislav Rutenburg

Browse the full INFOCOM paper archive.