Articles producció científicaEnginyeria Informàtica i Matemàtiques

Greedy Routing in Circulant Networks

  • Identification data

    Identifier:  imarina:9261594
    Handle: https://hdl.handle.net/20.500.11797/imarina9261594
    Authors:  Perez-Roses, Hebert; Bras-Amoros, Maria; Miguel Serradilla-Merinero, Jose
    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.

  • Others:

    Link to the original source: https://link.springer.com/article/10.1007/s00373-022-02489-9
    APA: Perez-Roses, Hebert; Bras-Amoros, Maria; Miguel Serradilla-Merinero, Jose (2022). Greedy Routing in Circulant Networks. Graphs And Combinatorics, 38(3), 86-. DOI: 10.1007/s00373-022-02489-9
    Paper original source: Graphs And Combinatorics. 38 (3): 86-
    Article's DOI: 10.1007/s00373-022-02489-9
    Journal publication year: 2022
    Entity: Universitat Rovira i Virgili
    Paper version: info:eu-repo/semantics/acceptedVersion
    Record's date: 2025-03-15
    URV's Author/s: Bras Amoros, Maria / Pérez Rosés, Hebert / Serradilla Merinero, José Miguel
    Department: Enginyeria Informàtica i Matemàtiques
    Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
    Publication Type: Journal Publications
    Author, as appears in the article.: Perez-Roses, Hebert; Bras-Amoros, Maria; Miguel Serradilla-Merinero, Jose
    licence for use: https://creativecommons.org/licenses/by/3.0/es/
    Thematic Areas: Theoretical computer science, Mathematics, Matemática / probabilidade e estatística, Interdisciplinar, Discrete mathematics and combinatorics, Ciência da computação
    Author's mail: hebert.perez@urv.cat, maria.bras@urv.cat

  • Keywords:

    Network routing
    Network design
    Greedy algorithm
    Diameter problem
    Degree/diameter problem
    Degree-diameter problem
    Degree
    Circulant graphs
    Cayley-graphs
    Algorithm
    Discrete Mathematics and Combinatorics
    Mathematics
    Theoretical Computer Science
    Matemática / probabilidade e estatística
    Interdisciplinar
    Ciência da computação

  • Documents:

    DocumentPrincipal

  • Cerca a google

    Search to google scholar