Add to ORKGBibliography: p. 29."June, 1981."U.S. Department of Defense contract No. N00014-75-C-1183 Office of Naval Research Contract ONR/N00014-77-C-0532Francine B.M. Zerbib and Adrian Segall
An algorithm is presemed for finding a single source shortest path tree in a planar undirected distr...
Efficient management of networks requires that the shortest route from one point (node) to another i...
In this paper, we study the problem of dynamically update all-pairs shortest paths in a distributed ...
We present a distributed protocol for obtaining the shortest paths between all pairs of nodes in a n...
Cover title.Includes bibliographical references.Supported in part by the Codex Corporation. Supporte...
International Telemetering Conference Proceedings / November 14-16, 1978 / Hyatt House Hotel, Los An...
In this paper the network problem of determining all-pairs shortest-path is examined. A distributed ...
Nowadays we use multi-core processors and broadband internet, which is usually available. If we want...
Abstract: In this paper the network problem of determining all-pairs shortest-path is examined. A di...
This paper presents a decentralized shortest path algorithm which finds the shortest distances betwe...
Abstract-A family of distributed algorithms for the dynamic computation of the shortest paths in a c...
Bibliography: p. 21.Supported in part by National Science Foundation Grant NSF-ECS-8310698 and in pa...
We propose a fully dynamic distributed algorithm for the all-pairs shortest paths problem on general...
AbstractWe propose a fully dynamic distributed algorithm for the all-pairs shortest paths problem on...
A distributed program is developed to allow a process in a network to determine a path from itself ...
An algorithm is presemed for finding a single source shortest path tree in a planar undirected distr...
Efficient management of networks requires that the shortest route from one point (node) to another i...
In this paper, we study the problem of dynamically update all-pairs shortest paths in a distributed ...
We present a distributed protocol for obtaining the shortest paths between all pairs of nodes in a n...
Cover title.Includes bibliographical references.Supported in part by the Codex Corporation. Supporte...
International Telemetering Conference Proceedings / November 14-16, 1978 / Hyatt House Hotel, Los An...
In this paper the network problem of determining all-pairs shortest-path is examined. A distributed ...
Nowadays we use multi-core processors and broadband internet, which is usually available. If we want...
Abstract: In this paper the network problem of determining all-pairs shortest-path is examined. A di...
This paper presents a decentralized shortest path algorithm which finds the shortest distances betwe...
Abstract-A family of distributed algorithms for the dynamic computation of the shortest paths in a c...
Bibliography: p. 21.Supported in part by National Science Foundation Grant NSF-ECS-8310698 and in pa...
We propose a fully dynamic distributed algorithm for the all-pairs shortest paths problem on general...
AbstractWe propose a fully dynamic distributed algorithm for the all-pairs shortest paths problem on...
A distributed program is developed to allow a process in a network to determine a path from itself ...
An algorithm is presemed for finding a single source shortest path tree in a planar undirected distr...
Efficient management of networks requires that the shortest route from one point (node) to another i...
In this paper, we study the problem of dynamically update all-pairs shortest paths in a distributed ...