Shortest-Path Routing in Arbitrary Networks
F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.
Download
No fulltext has been uploaded.
Journal Article
| Published
| English
Author
Meyer auf der Heide, FriedhelmLibreCat;
Vöcking, Berthold
Publishing Year
Journal Title
Journal of Algorithms
Page
105-131
ISSN
LibreCat-ID
Cite this
Meyer auf der Heide F, Vöcking B. Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms. 1999:105-131. doi:10.1006/jagm.1998.0980
Meyer auf der Heide, F., & Vöcking, B. (1999). Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms, 105–131. https://doi.org/10.1006/jagm.1998.0980
@article{Meyer auf der Heide_Vöcking_1999, title={Shortest-Path Routing in Arbitrary Networks}, DOI={10.1006/jagm.1998.0980}, journal={Journal of Algorithms}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1999}, pages={105–131} }
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, 105–31. https://doi.org/10.1006/jagm.1998.0980.
F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary Networks,” Journal of Algorithms, pp. 105–131, 1999.
Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, pp. 105–31, doi:10.1006/jagm.1998.0980.
Google Scholar