Autor según el artículo: Perez-Roses, Hebert; Bras-Amoros, Maria; Miguel Serradilla-Merinero, Jose;
Departamento: Enginyeria Informàtica i Matemàtiques
Autor/es de la URV: Bras Amoros, Maria / Pérez Rosés, Hebert / Serradilla Merinero, José Miguel
Palabras clave: Network routing Network design Greedy algorithm Diameter problem Degree-diameter problem Degree Circulant graphs Cayley-graphs Algorithm
Resumen: 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.
Áreas temáticas: Theoretical computer science Mathematics Matemática / probabilidade e estatística Interdisciplinar Discrete mathematics and combinatorics Ciência da computação
Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
Direcció de correo del autor: hebert.perez@urv.cat maria.bras@urv.cat
Identificador del autor: 0000-0002-3481-004X
Fecha de alta del registro: 2024-09-07
Versión del articulo depositado: info:eu-repo/semantics/acceptedVersion
URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
Referencia al articulo segun fuente origial: Graphs And Combinatorics. 38 (3):
Referencia de l'ítem segons les normes 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
Entidad: Universitat Rovira i Virgili
Año de publicación de la revista: 2022
Tipo de publicación: Journal Publications
Repositori URV