Shortest-Path Routing in Arbitrary Networks
Open Access
- 1 April 1999
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 31 (1) , 105-131
- https://doi.org/10.1006/jagm.1998.0980
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Distributed packet switching in arbitrary networksPublished by Association for Computing Machinery (ACM) ,1996
- Universal algorithms for store-and-forward and wormhole routingPublished by Association for Computing Machinery (ACM) ,1996
- A packet routing protocol for arbitrary networksPublished by Springer Nature ,1995
- Randomized Routing and Sorting on Fixed-Connection NetworksJournal of Algorithms, 1994
- Packet routing and job-shop scheduling inO(congestion+dilation) stepsCombinatorica, 1994
- How to emulate shared memoryJournal of Computer and System Sciences, 1991
- Universal packet routing algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Efficient Schemes for Parallel CommunicationJournal of the ACM, 1984
- A Scheme for Fast Parallel CommunicationSIAM Journal on Computing, 1982
- Randomized parallel communication (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1982