Premium
Cyclic gossiping times for some classes of graphs
Author(s) -
Knisely James A.,
Laskar Renu
Publication year - 1996
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199610)28:3<135::aid-net2>3.0.co;2-o
Subject(s) - gossip , broadcasting (networking) , computer science , dissemination , variation (astronomy) , telecommunications network , theoretical computer science , computer network , telecommunications , psychology , social psychology , physics , astrophysics
Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person in the network knows a unique item of information and needs to communicate it to everyone else. In broadcasting, one individual has an item of information which needs to be communicated to everyone else. A variation of gossiping, called cyclic gossiping, recently introduced by Liestman and Richards, is studied here for certain classes of graphs. © 1996 John Wiley & Sons, Inc.