Back to Search
Start Over
Greedy Routing in Circulant Networks
- Source :
- Graphs And Combinatorics; 10.1007/s00373-022-02489-9; Graphs And Combinatorics. 38 (3):
- Publication Year :
- 2022
-
Abstract
- We address the problem of constructing large circulant networks with given degree and diameter, and efficient routing schemes. First we discuss the theoretical upper bounds and their asymptotics. Then we apply concepts and tools from the change-making problem to efficient routing in circulant graphs. With these tools we investigate some of the families of circulant graphs that have been proposed in the literature, and we construct tables of large circulant graphs and digraphs with efficient routing properties.
Details
- Database :
- OAIster
- Journal :
- Graphs And Combinatorics; 10.1007/s00373-022-02489-9; Graphs And Combinatorics. 38 (3):
- Publication Type :
- Electronic Resource
- Accession number :
- edsoai.on1443572349
- Document Type :
- Electronic Resource