Author, as appears in the article.: Perez-Roses, Hebert; Bras-Amoros, Maria; Miguel Serradilla-Merinero, Jose;
Department: Enginyeria Informàtica i Matemàtiques
URV's Author/s: Bras Amoros, Maria / Pérez Rosés, Hebert / Serradilla Merinero, José Miguel
Keywords: Network routing Network design Greedy algorithm Diameter problem Degree-diameter problem Degree Circulant graphs Cayley-graphs Algorithm
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.
Thematic Areas: Theoretical computer science Mathematics Matemática / probabilidade e estatística Interdisciplinar Discrete mathematics and combinatorics Ciência da computação
licence for use: https://creativecommons.org/licenses/by/3.0/es/
Author's mail: hebert.perez@urv.cat maria.bras@urv.cat
Author identifier: 0000-0002-3481-004X
Record's date: 2024-09-07
Papper version: info:eu-repo/semantics/acceptedVersion
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
Papper original source: Graphs And Combinatorics. 38 (3):
APA: Perez-Roses, Hebert; Bras-Amoros, Maria; Miguel Serradilla-Merinero, Jose; (2022). Greedy Routing in Circulant Networks. Graphs And Combinatorics, 38(3), -. DOI: 10.1007/s00373-022-02489-9
Entity: Universitat Rovira i Virgili
Journal publication year: 2022
Publication Type: Journal Publications
Repositori URV