Paper Info
Title
Efficient heuristics for message dissemination in networks
Abstract
We present here a heuristic for broadcasting and a heuristic for gossiping. These heuristics outperform the previous heuristics in several network generators. The heuristic for gossiping also has a lower time complexity than the best heuristic in practice.
Year
Venue
Keywords
2007
Parallel and Distributed Computing and Networks
efficient heuristics,lower time complexity,message dissemination,network generator,previous heuristics,best heuristic
Field
DocType
Citations 
Broadcasting,Heuristic,Computer science,Gossip,Theoretical computer science,Heuristics,Time complexity,Null-move heuristic
Conference
0
PageRank 
References 
Authors
0.34
17
2
Name
Order
Citations
PageRank
Hovhannes A. Harutyunyan120628.18
Bin Shao200.34