Broadcast and gossip in line-communication mode

DOI10.1016/S0166-218X(97)00054-1zbMATH Open0898.05079MaRDI QIDQ1382273FDOQ1382273

Authors: Christian Laforest 

Publication date: 1 November 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

Recommendations

• Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
• Optimal algorithms for broadcast and gossip in the edge-disjoint modes
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time

zbMATH Keywords

treesbroadcastgossipline-communication network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05)

Cites Work

• Graph theory with applications
• A survey of gossiping and broadcasting in communication networks
• Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
• Methods and problems of communication in usual networks
• Line broadcasting in cycles
• New gossips and telephones
• Minimum-time line broadcast networks

Cited In (23)

• Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
• Neighborhood Communications in Networks
• On linear-time data dissemination in dynamic rooted trees
• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• Fast Gossiping for the Hypercube
• Information spreading by mobile particles on a line
• The addition game: An abstraction of a communication problem
• Hierarchical broadcast and gossip networks
• Note on optimal gossiping in some weak-connected graphs
• Gossiping and broadcasting versus computing functions in networks.
• Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols
• Gossip Latin square and the meet-all gossipers problem
• Fast information sharing in a complete network
• Faster gossiping on butterfly networks
• Line-broadcasting in complete \(k\)-ary trees
• Convergence of periodic gossiping algorithms
• Title not available (Why is that?)
• Minimum gossip bus networks
• Gossiping in chordal rings under the line model
• A survey of gossiping and broadcasting in communication networks
• Set to set broadcasting in communication networks
• Fast gossiping by short messages
• Odd gossiping

This page was built for publication: Broadcast and gossip in line-communication mode

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382273)