Published in

Springer, Lecture Notes in Computer Science, p. 133-150, 1991

DOI: 10.1007/3-540-54099-7_10

Mathematical Systems Theory, 2(25), p. 93-122

DOI: 10.1007/bf02835831

Links

Tools

Export citation

Search in Google Scholar

Efficient distributed algorithms for single-source shortest paths and related problems on plane networks

Journal article published in 1991 by Ravi Janardan, Siu Wing Cheng ORCID
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO