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