Optimal gossiping in paths and cycles
From MaRDI portal
Publication:1827271
DOI10.1016/S1570-8667(03)00038-8zbMATH Open1077.68120MaRDI QIDQ1827271FDOQ1827271
Publication date: 6 August 2004
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 2061800
- On optimal solutions to the problem of gossiping in minimum time
- Note on optimal gossiping in some weak-connected graphs
- Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model
- Optimal sequential gossiping by short messages
- Cyclic gossiping times for some classes of graphs
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
- Optimal odd gossiping
- Gossiping in vertex-disjoint paths mode in interconnection networks
Cites Work
- A survey of gossiping and broadcasting in communication networks
- Fast Gossiping by Short Messages
- Methods and problems of communication in usual networks
- Title not available (Why is that?)
- Gossiping in Minimal Time
- Optimal sequential gossiping by short messages
- Sequential information dissemination by packets
- Parallel Information Dissemination by Packets
- Fast gossiping on square mesh computers
- Fast Gossiping for the Hypercube
- Time and Cost Trade-Offs in Gossiping
Cited In (8)
- Optimal gossip with direct addressing
- Communication complexity of gossiping by packets
- Structural Information and Communication Complexity
- The relationship between gossiping in vertex-disjoint paths mode and bisection width
- The partial gossiping problem
- Order optimal information spreading using algebraic gossip
- Optimal gossiping in square 2D meshes
- Title not available (Why is that?)
This page was built for publication: Optimal gossiping in paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827271)
