An Optimal Algorithm for Broadcasting Multiple Messages in Trees

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.59, Iss.3, 1999-12, pp. : 465-474

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimal Broadcasting in Faulty Trees

By Panaite P. Pelc A.

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 5, 2000-05 ,pp. : 566-584

Academic Press

Access to resources Recommend Favorite

Hyper‐star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 16, 2015-11 ,pp. : 4186-4193

John Wiley & Sons Inc

Access to resources Recommend Favorite

A linear-time optimal-message distributed algorithm for minimum spanning trees

By Faloutsos Michalis Molle Mart

Distributed Computing, Vol. 17, Iss. 2, 2004-08 ,pp. : 151-170

Springer Publishing Company

Access to resources Recommend Favorite

BETWEEN BROADCASTING POLITICAL MESSAGES AND INTERACTING WITH VOTERS

By Graham Todd Broersma Marcel Hazelhoff Karin van 't Haar Guido

Information, Communication and Society, Vol. 16, Iss. 5, 2013-06 ,pp. : 692-716

Routledge Ltd

Access to resources Recommend Favorite

An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels

By Hsu Chih-Hao Lee Guanling Chen Arbee

Distributed and Parallel Databases, Vol. 18, Iss. 3, 2005-11 ,pp. : 207-222

Springer Publishing Company

Access to resources Recommend Favorite