Copy the page URI to the clipboard
Shim, S.; Zerovnik, J. and Siran, J.
(2002).
DOI: https://doi.org/10.1016/S0166-218X(01)00310-9
Abstract
In this note we disprove the uniform shortest path routing conjecture for vertex-transitive graphs by constructing an infinite family of counterexamples.
Viewing alternatives
Metrics
Public Attention
Altmetrics from AltmetricNumber of Citations
Citations from DimensionsItem Actions
Export
About
- Item ORO ID
- 8098
- Item Type
- Journal Item
- ISSN
- 0166-218X
- Keywords
- Routing; Shortest path; Vertex-transitive graph
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Depositing User
- Jozef Širáň