Gossiping in chordal rings under the line model
From MaRDI portal
Publication:5941561
DOI10.1016/S0304-3975(00)00213-9zbMath0972.68010OpenAlexW2018447406WikidataQ126297581 ScholiaQ126297581MaRDI QIDQ5941561
Lali Barrière, Johanne Cohen, Margarida Mitjana
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00213-9
Related Items
Equalising the transmission properties of graph-modelled networks by introducing the control of the resources used to transmit information ⋮ Random walks, bisections and gossiping in circulant graphs
Cites Work
- Unnamed Item
- Methods and problems of communication in usual networks
- Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
- Minimum-time line broadcast networks
- Broadcasting in generalized chordal rings
- Software Libraries for Linear Algebra Computations on High Performance Computers
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
- Self-dual configurations and regular graphs