9 citations · 18 across the 10 of their papers we have counts for
11 papers
All-to-all Routing on Kautz Graphs: Regular Routing Beats Shortest Paths
Vance Faber, Noah Streib
We study packet routing in the Kautz digraph K(d,D), where every ordered pair of distinct vertices is connected by a unique shortest directed path. The regular routing introduced i…
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…
Network Routing on Regular Digraphs and Their Line Graphs
Vance Faber, Noah Streib
This paper concerns all-to-all network routing on regular digraphs. In previous work we focused on efficient routing in highly symmetric digraphs with low diameter for fixed degree…
All-to-all Routing on Digraph Networks
Nyumbu Chishwashwa, Vance Faber, Noah Streib
We discuss an open problem and its converse first posed by Dougherty and Faber in [3], "Network routing on regular directed graphs from spanning factorizations." Does every vertex…
Iterated Decomposition of Biased Permutations Via New Bounds on the Spectral Gap of Markov Chains
Sarah Miracle, Amanda Pascoe Streib, Noah Streib
The spectral gap of a Markov chain can be bounded by the spectral gaps of constituent "restriction" chains and a "projection" chain, and the strength of such a bound is the content…
Dimension of posets with planar cover graphs excluding two long incomparable chains
David M. Howard, Noah Streib, William T. Trotter +2
It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must h…