DSpace Repository

Communication complexity of distributed shortest path algorithms

Communication complexity of distributed shortest path algorithms

Awerbuch, Baruch.; Gallager, Robert G.
URI: http://koha.mediu.edu.my:8181/xmlui/handle/1721
Date: 2013-06-05

Description:

 
Baruch Awerbuch, Robert G. Gallager.
 
Bibliography: p. 21.
 
Supported in part by National Science Foundation Grant NSF-ECS-8310698 and in part by the Defense Advanced Research Projects Agency under Contract ONR/N00014-84-K-0357.
 

Show full item record

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Search DSpace


Advanced Search

Browse

My Account