A note on recursive properties of the de Bruijn, Kautz and FFT digraphs

DOI10.1016/0020-0190(94)00210-PzbMath0875.68683OpenAlexW2054066640MaRDI QIDQ673992

Marie-Claude Heydemann, Dominique Sotteau

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00210-p

zbMATH Keywords

FFTKautz digraphde Bruijn digraphInterconnection networksCycles

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ Particular cycles of a binary de Bruijn digraph

Cites Work

• Group Action Graphs and Parallel Architectures
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Unnamed Item

This page was built for publication: A note on recursive properties of the de Bruijn, Kautz and FFT digraphs