scientific article; zbMATH DE number 3869354

zbMATH Open0546.05025MaRDI QIDQ3337487FDOQ3337487

Authors: Grant A. Cheston, Stephen T. Hedetniemi 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• On the communication complexity of polling
• ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
• On Adaptive Tree Polling Algorithms
• scientific article; zbMATH DE number 3934937
• Polynomial-time algorithms for minimum-time broadcast in trees

zbMATH Keywords

tree networkmessage transfers

Mathematics Subject Classification ID

Trees (05C05) Communication, information (94A99) Operations research and management science (90B99)

Cited In (3)

• On the communication complexity of polling
• On Adaptive Tree Polling Algorithms
• A survey of gossiping and broadcasting in communication networks

This page was built for publication:

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