On the number of broadcast schemes in networks

Authors:
Calin D. Morosan
Affiliations:
Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, Canada
Venue:
Information Processing Letters
Year:
2006

Citing 14
Cited 0

Unranking and ranking spanning trees of a graph

Journal of Algorithms
Parallel algorithms for gossiping by mail

Information Processing Letters
The random walk construction of uniform spanning trees and uniform labelled trees

SIAM Journal on Discrete Mathematics
Sparse broadcast graphs

Discrete Applied Mathematics
Methods and problems of communication in usual networks

Proceedings of the international workshop on Broadcasting and gossiping 1990
A minimum broadcast graph on 63 vertices

Proceedings of the international workshop on Broadcasting and gossiping 1990
Approximation Algorithms for Minimum-Time Broadcast

SIAM Journal on Discrete Mathematics
Lower bounds for the size in four families of minimum broadcast graphs

Discrete Mathematics - Special issue: selected papers in honour of Paul Erdo&huml;s on the occasion of his 80th birthday
Generating random spanning trees more quickly than the cover time

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for broadcasting and gossiping

Journal of Parallel and Distributed Computing
Hierarchical broadcast networks

Information Processing Letters
More broadcast graphs

Discrete Applied Mathematics
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.89

Visualization

Abstract

Broadcasting is the process of spreading one piece of information among a group of individuals connected by an interconnection network. In this paper we give exact lower and upper bounds for the number of broadcast schemes in arbitrary networks. Also, we give the exact value for complete bipartite graphs and an upper bound for regular networks. Based on the counting method we describe a new random algorithm for broadcasting in networks.