Algebraic Constructions for the Digraph Routing Problems

Nyumbu Chishwashwa, Vance Faber, Noah Streib

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two ve…