Low Time Complexity Algorithms for Path Computation in Cayley Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2019

Low Time Complexity Algorithms for Path Computation in Cayley Graphs

Abstract

We study the problem of path computation in Cayley Graphs (CG) from an approach of word processing in groups. This approach consists in encoding the topological structure of CG in an automaton called Diff , then techniques of word processing are applied for computing the shortest paths. We present algorithms for computing the K-shortest paths, the shortest disjoint paths and the shortest path avoiding a set of nodes and edges. For any CG with diameter D, the time complexity of the proposed algorithms is O(KD|Diff |), where |Diff | denotes the size of Diff. We show that our proposal outperforms the state of art of topology-agnostic algorithms for disjoint shortest paths and stays competitive with respect to proposals for specific families of CG. Therefore, the proposed algorithms set a base in the design of adaptive and low-complexity routing schemes for networks whose interconnections are defined by CG.
Fichier principal
Vignette du fichier
cga_final.pdf (285.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01973608 , version 1 (08-01-2019)

Identifiers

Cite

Daniela Aguirre-Guerrero, Guillaume Ducoffe, Lluis Fabrega, Pere Vila, David Coudert. Low Time Complexity Algorithms for Path Computation in Cayley Graphs. Discrete Applied Mathematics, 2019, 259, pp.218-225. ⟨10.1016/j.dam.2018.12.005⟩. ⟨hal-01973608⟩
104 View
295 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More