Deterministic broadcasting time with par
โ
Gianluca De Marco; Andrzej Pelc
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 143 KB
We consider the time of deterministic broadcasting in networks whose nodes have limited knowledge of network topology. Each node v knows only the part of the network within knowledge radius r from it, i.e., it knows the graph induced by all nodes at distance at most r from v. Apart from that, each n