Uniform homomorphisms of de Bruijn and Kautz networks

Annexstein, 1995, Ranking algorithms for hamiltonian paths in hypercubic networks, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 21, 1, 10.1090/dimacs/021/01 Bermond, 1994, Broadcasting and gossiping in de Bruijn networks, SIAM J. Comput., 23, 212, 10.1137/S0097539791197852 Bermond, 1989, De Bruijn and Kautz networks: a competitor for the hypercube?, 279 Bodlaender, 1987, Distributed computing: structure and complexity Bond, 1987, Grands réseaux d'interconnexion de Bruijn, 1946, A combinatorical problem, A49, 758 Fiol, 1984, Line digraph iterations and the (d, k) digraph problem, IEEE Trans. Comput., C-33, 400, 10.1109/TC.1984.1676455 Fishburn, 1982, Quotient networks, IEEE Trans. Comput., C-31, 288, 10.1109/TC.1982.1675994 Kautz, 1968, Bounds on directed (d, k) graphs, Theory of cellular logic networks and machines, AFCRL- 68-0668 Final rep., 20 Lempel, 1970, On a homomorphism of the de Bruijn graph and its application to the design of feedback shift registers, IEEE Trans. Comput., C-19, 1204, 10.1109/T-C.1970.222859 de Rumeur, 1994, Communications dans les réseaux de processeurs Samatham, 1989, The de Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI, IEEE Trans. Comput., C-38, 567, 10.1109/12.21149 Tvrdik, 1995, Uniform homomorphisms of the de Bruijn and Kautz networks, 10.1016/S0166-218X(97)00115-7 Villar, 1992, The underlying graph of a line digraph, Discrete Appl. Math., 37/38, 525, 10.1016/0166-218X(92)90156-5 Zhong, 1992, Optimal implementation of parallel Divide-and-Conquer algorithms on de Bruijn networks, 583