Broadcasting and Gossiping in de Bruijn Networks

DOI10.1137/S0097539791197852zbMath0802.68094OpenAlexW2080888633MaRDI QIDQ4286237

Pierre Fraigniaud, Jean-Claude Bermond

Publication date: 27 March 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539791197852

zbMATH Keywords

interconnection networksde Bruijn digraphsbroadcastingde Bruijn networksarc-disjoint spanning treesgossiping protocols

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (15)

Containment of butterflies in networks constructed by the line digraph operation ⋮ D2B: A de Bruijn based content-addressable network ⋮ Methods and problems of communication in usual networks ⋮ On edge-disjoint spanning trees with small depths ⋮ Data center interconnection networks are not hyperbolic ⋮ Embedding de Bruijn, Kautz and shuffle-exchange networks in books ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs ⋮ Uniform homomorphisms of de Bruijn and Kautz networks ⋮ Unnamed Item ⋮ Spanning trees: A survey ⋮ Independent spanning trees with small depths in iterated line digraphs ⋮ Faster gossiping on butterfly networks ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Miscellaneous Digraph Classes ⋮ Factorization of de Bruijn digraphs by cycle-rooted trees

This page was built for publication: Broadcasting and Gossiping in de Bruijn Networks