Paper Info
Title
Optimum Broadcasting in Complete Weighted-Vertex Graphs
Abstract
The weighted-vertex broadcast model is an extension of the original model of broadcasting to the graphs with weighted vertices. A vertex of weight 驴 is supposed to wait for 驴 time rounds before sending data to its neighbors; after this delay, in each round, it can inform one of its neighbors with no additional delay. We consider the problem in complete weighted-vertex graphs, and introduce a set of properties which describe a class of optimum solutions. Based on these, we present an algorithm which gives optimum broadcast schemes in polynomial time.
Year
DOI
Venue
2010
10.1007/978-3-642-11266-9_41
Conference on Current Trends in Theory and Practice of Informatics
Keywords
Field
DocType
polynomial time
Broadcasting,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Computer science,Chordal graph,Time complexity
Conference
Volume
ISSN
Citations 
5901
0302-9743
1
PageRank 
References 
Authors
0.37
9
2
Name
Order
Citations
PageRank
Hovhannes A. Harutyunyan120628.18
Shahin Kamali211215.41