Broadcasting and spanning trees in de Bruijn and Kautz networks

DOI10.1016/0166-218X(92)90141-VzbMath0755.94017OpenAlexW2055596426MaRDI QIDQ1199434

S. Singh

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90141-v

zbMATH Keywords

Kautz digraphcommunication networkinformation disseminationde Bruijn digraphbroadcast times

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Methods and problems of communication in usual networks ⋮ Broadcasting in butterfly and deBruijn networks ⋮ Broadcast time and connectivity ⋮ Metric dimension of directed graphs ⋮ Broadcasting in butterfly and debruijn networks ⋮ Broadcasting in cycle prefix digraphs ⋮ Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse broadcast graphs
• Minimum broadcast digraphs
• Information Dissemination in Trees
• Broadcasting in Bounded Degree Graphs
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: Broadcasting and spanning trees in de Bruijn and Kautz networks