Set to set broadcasting in communication networks

DOI10.1016/0166-218X(92)90010-8zbMath0765.94027MaRDI QIDQ1208457

Hsun-Ming Lee, Gerard Jennhwa Chang

Publication date: 16 May 1993

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

zbMATH Keywords

treegraphcomplete graphlinear-time algorithmsbroadcastsGossip

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Communication theory (94A05)

Related Items (3)

The broadcast median problem in heterogeneous postal model ⋮ Concurrent multicast in weighted networks ⋮ Concurrent multicast in weighted networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quick gossiping without duplicate transmissions
• Further gossip problems
• New gossips and telephones
• The communication problem on graphs
• Spreading information by conferences
• Gossips and telephones
• The gossip problem
• Generalizations of broadcasting and gossiping
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• A Problem with Telephones
• A Cure for the Telephone Disease

This page was built for publication: Set to set broadcasting in communication networks