Communication complexity of distributed shortest path algorithms

Communication complexity of distributed shortest path algorithms

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979. === MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. === Includes bibliographical references. === by Daniel U. Friedman. === M.S.

Bibliographic Details
Main Author: Friedman, Daniel Uri
Other Authors: Robert Gallager.
Format: Others
Language:English
Published: Massachusetts Institute of Technology 2005
Subjects:
Electrical Engineering and Computer Science.
Computational complexity
Electronic data processing Distributed processing
Computer networks
Algorithms
Online Access:http://hdl.handle.net/1721.1/16054

Internet

http://hdl.handle.net/1721.1/16054

Similar Items