Broadcasting and Gossiping in de Bruijn Networks
DOI10.1137/S0097539791197852zbMATH Open0802.68094OpenAlexW2080888633MaRDI QIDQ4286237FDOQ4286237
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
Recommendations
- Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
- Broadcasting in butterfly and deBruijn networks
- A survey of gossiping and broadcasting in communication networks
- Broadcasting in butterfly and deBruijn networks (extended abstract)
- On generalized gossiping and broadcasting
- scientific article; zbMATH DE number 857072
- Verifiable broadcasting and gossiping in communication networks
- Gossiping and broadcasting versus computing functions in networks
- Algorithms - ESA 2003
- scientific article; zbMATH DE number 2089989
broadcastinginterconnection networksde Bruijn digraphsde Bruijn networksarc-disjoint spanning treesgossiping protocols
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cited In (22)
- Factorization of de Bruijn digraphs by cycle-rooted trees
- Title not available (Why is that?)
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- D2B: A de Bruijn based content-addressable network
- Miscellaneous Digraph Classes
- Spanning trees: A survey
- Communication complexity of fault-tolerant information diffusion
- Containment of butterflies in networks constructed by the line digraph operation
- Title not available (Why is that?)
- On edge-disjoint spanning trees with small depths
- Title not available (Why is that?)
- Data center interconnection networks are not hyperbolic
- Title not available (Why is that?)
- Uniform homomorphisms of de Bruijn and Kautz networks
- Analyzing network coding gossip made easy
- Title not available (Why is that?)
- Faster gossiping on butterfly networks
- Methods and problems of communication in usual networks
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books
- Independent spanning trees with small depths in iterated line digraphs
- Algorithms - ESA 2003
- A broadcasting protocol in line digraphs
This page was built for publication: Broadcasting and Gossiping in de Bruijn Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286237)
