Distributed algorithms for computing shortest pairs of disjoint paths
- 1 March 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (2), 443-455
- https://doi.org/10.1109/18.212275
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The Multi-Tree Approach To Reliability In Distributed NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Dynamic networks are as fast as static networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Applying static network protocols to dynamic networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Reducing complexities of the distributed max‐flow and breadth‐first‐search algorithms by means of network synchronizationNetworks, 1985
- Complexity of network synchronizationJournal of the ACM, 1985
- A new distributed Depth-First-Search algorithmInformation Processing Letters, 1985
- A quick method for finding shortest pairs of disjoint pathsNetworks, 1984
- Disjoint paths in a networkNetworks, 1974