ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS

DOI10.1142/S0129054199000150zbMath1319.68161OpenAlexW2051138566MaRDI QIDQ5249000

No author found.

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054199000150

zbMATH Keywords

graph algorithmscommunication complexitybroadcastingpolling algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Belated Analyses of Three Credit-Based Adaptive Polling Algorithms

Cites Work

• Clock synchronization and the power of broadcasting
• Distributed network protocols
• Sequential information dissemination by packets
• Parallel Information Dissemination by Packets

This page was built for publication: ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS