1 citations · 1 across the 5 of their papers we have counts for
5 papers
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…
Linear Hypergraph List Edge Coloring - Generalizations of the EFL Conjecture to List Coloring
Vance Faber
Motivated by the Erdős-Faber-Lovász (EFL) conjecture for hypergraphs, we consider the list edge coloring of linear hypergraphs. We discuss several conjectures for list edge colorin…
Transpose on vertex symmetric digraphs
Vance Faber
We discuss transpose (sometimes called universal exchange or all-to-all) on vertex symmetric networks. We provide a method to compare the efficiency of transpose schemes on two dif…
Automorphisms of the cycle prefix digraph
William Y. C. Chen, Vance Faber, Bingqing Li
Cycle prefix digraphs have been proposed as an efficient model of symmetric interconnection networks for parallel architecture. It has been discovered that the cycle prefix network…
Analysis of first order systems for the solution of Laplace's equation
Vance Faber
Kelner, Orecchia, Sidford, and Zhu have given a randomized iterative method for approximating the solution to the discrete Laplace equation that has expected running time nearly li…