Fast Gossiping by Short Messages
From MaRDI portal
Publication:4210076
DOI10.1137/S0097539795283619zbMATH Open0960.94044OpenAlexW1976039605MaRDI QIDQ4210076FDOQ4210076
Adele A. Rescigno, Ugo Vaccaro, Jean-Claude Bermond, Luisa Gargano
Publication date: 20 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539795283619
Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)
Cited In (25)
- GATHERING RADIO MESSAGES IN THE PATH
- Gossiping in Minimal Time
- Communication complexity of gossiping by packets
- Bounded information dissemination in multi-channel wireless networks
- Fast Gossiping for the Hypercube
- Optimal gathering protocols on paths under interference constraints
- Communication complexity of fault-tolerant information diffusion
- On the communication complexity of polling
- The total acquisition number of random geometric graphs
- An inclusion hierarchy of irreversible dynamos
- Gossiping with interference in radio ring networks
- Fast information sharing in a complete network
- The total acquisition number of random graphs
- Oblivious gossiping on tori
- Multi-level dynamo and opinion spreading
- Quick Gossiping by Conference Calls
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
- The unit acquisition number of binomial random graphs
- Minimum gossip bus networks
- Title not available (Why is that?)
- On the hamiltonicity of the Cartesian product
- Concurrent multicast in weighted networks
- Fast gossiping by short messages
- Optimal gossiping in paths and cycles
- Optimal gossiping in square 2D meshes
Recommendations
- Fast gossiping by short messages π π
- Fast gossiping with short unreliable messages π π
- Gossiping in Minimal Time π π
- Quick gossiping by telegraphs π π
- Title not available (Why is that?) π π
- Quick gossiping without duplicate transmissions π π
- Title not available (Why is that?) π π
- Gossiping With Multiple Messages π π
- Quick Gossiping by Conference Calls π π
This page was built for publication: Fast Gossiping by Short Messages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210076)