Reducing complexities of the distributed max‐flow and breadth‐first‐search algorithms by means of network synchronization
- 1 December 1985
- Vol. 15 (4) , 425-437
- https://doi.org/10.1002/net.3230150404
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Complexity of network synchronizationJournal of the ACM, 1985
- Graph Traversal Techniques and the Maximum Flow Problem in Distributed ComputationIEEE Transactions on Software Engineering, 1983
- Decentralized maximum‐flow protocolsNetworks, 1982
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982
- Distributed Minimum Hop AlgorithmsPublished by Defense Technical Information Center (DTIC) ,1982
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980