Broadcast and gossip in line-communication mode

DOI10.1016/S0166-218X(97)00054-1zbMath0898.05079MaRDI QIDQ1382273

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

zbMATH Keywords

treesbroadcastgossipline-communication network

Mathematics Subject Classification ID

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

Cites Work

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

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