Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complexity of network synchronization
Journal of the ACM (JACM)
Data networks
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A time-optimal message-efficient distributed algorithm for depth-first-search
Information Processing Letters
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
Graph Algorithms
On the Use of Synchronizers for Asynchronous Communication Networks
Proceedings of the 2nd International Workshop on Distributed Algorithms
A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph
ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
A Single Source Shortest Path Algorithm for a Planar Distributed Network
STACS '85 Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science
Decentralized algorithms in distributed systems
Decentralized algorithms in distributed systems
Distributed algorithms for locating centers and medians in communication networks
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Shortest hop multipath algorithm for wireless sensor networks
Computers & Mathematics with Applications
| Hi-index | 0.00 |
The design is discussed of distributed algorithms for the single-source shortest-path problem to run on an asynchronous directed network in which some of the edges may be associated with negative weights, and thus in which a cycle of negative total weight may also exist. The only existing solution in the literature for this problem is due to K.M. Chandy and J. Misra (1982), and it has, in the worst case, an unbounded message complexity. A synchronous version of the Chandy-Misra algorithm is described and studied, and it is proved that for a network with m edges and n nodes, the worst case message and time complexities of this algorithm are O(mn) and O(n), respectively. This algorithm is then combined with an efficient synchronizer to yield an asynchronous protocol that retains the same message and time complexities.