Uniform homomorphisms of de Bruijn and Kautz networks

DOI10.1016/S0166-218X(97)00115-7zbMath0902.68078OpenAlexW1969444182WikidataQ127024579 ScholiaQ127024579MaRDI QIDQ1392540

Marie-Claude Heydemann, Rabah Harbane, Pavel Tvrdík

Publication date: 26 November 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

line digraphsB/K digraphs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Uniform homomorphisms of de Bruijn and Kautz networks ⋮ Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays ⋮ Independence number of de Bruijn graphs ⋮ The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs ⋮ On a problem of walks

Cites Work

• The underlying graph of a line digraph
• Uniform homomorphisms of de Bruijn and Kautz networks
• Line Digraph Iterations and the (d, k) Digraph Problem
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Quotient Networks
• Broadcasting and Gossiping in de Bruijn Networks
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniform homomorphisms of de Bruijn and Kautz networks