Greedy routing in circulant networks
From MaRDI portal
Publication:2127722
DOI10.1007/s00373-022-02489-9zbMath1486.05291OpenAlexW4224134288MaRDI QIDQ2127722
Hebert Pérez-Rosés, José Miguel Serradilla-Merinero, Maria Bras-Amorós
Publication date: 21 April 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02489-9
Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searching for large multi-loop networks
- The maximum degree and diameter-bounded subgraph in the mesh
- The degree-diameter problem for circulant graphs of degree 8 and 9
- The degree-diameter problem for circulant graphs of degrees 10 and 11
- Optimal routing in double loop networks
- Combinatorics of the change-making problem
- A note on constructing large Cayley graphs of given degree and diameter by voltage assignments
- A polynomial-time algorithm for the change-making problem
- A survey on multi-loop networks.
- Cayley graphs of given degree and diameters 3, 4 and 5
- The degree/diameter problem for mixed abelian Cayley graphs
- Moore graphs and beyond: a survey of the degree/diameter problem
- A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
- Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
- Gossiping and routing in undirected triple-loop networks
- Reliable circulant networks with minimum transmission delay
- A Combinatorial Problem Related to Multimodule Memory Organizations
- A solution of the isomorphism problem for circulant graphs
- The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
- On the complexity of greedy routing in ring-based peer-to-peer networks