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

DOI10.1016/0020-0190(94)00210-PzbMATH Open0875.68683OpenAlexW2054066640MaRDI QIDQ673992FDOQ673992

Authors: Marie-Claude Heydemann, D. 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

Recommendations

• A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
• Asymptotically optimal \((\Delta, D', s)\)-digraphs
• De Bruijn and Kautz digraphs of a rooted tree
• scientific article; zbMATH DE number 4055643

zbMATH Keywords

FFTde Bruijn digraphKautz digraphInterconnection networksCycles

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Group Action Graphs and Parallel Architectures
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI

Cited In (6)

• Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
• Particular cycles of a binary de Bruijn digraph
• De Bruijn and Kautz digraphs of a rooted tree
• The Cayley digraph associated to the Kautz digraph.
• Title not available (Why is that?)
• De Bruijn digraphs and affine transformations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673992)