Paper Info
Title
The Number Of Rounds Needed To Exchange Information Within A Graph
Abstract
In [3] Cederbaum proposes the problem of finding a labelling of a connected graph G which minimizes the number of rounds needed to exchange information between all the points, where a round consists of the vertices of G each broadcasting once in order of their labels. In this paper we give a complete solution to the problem.
Year
DOI
Venue
1983
10.1016/0166-218X(83)90065-3
DISCRETE APPLIED MATHEMATICS
Field
DocType
Volume
Discrete mathematics,Broadcasting,Graph,Graph toughness,Combinatorics,Vertex (geometry),Graph power,Connectivity,Mathematics
Journal
6
Issue
ISSN
Citations 
2
0166-218X
5
PageRank 
References 
Authors
8.75
2
2
Name
Order
Citations
PageRank
S. F. Assmann18717.07
Daniel J. Kleitman2854277.98