Gossiping in circulant graphs

Authors

  • Romain Gay ENS Cachan, Paris

Keywords:

Gossiping, isoperimetric function, Cayley graphs, circulant graphs, cube. MSC (2010), 05C85, 68R10.

Abstract

We investigate the gossiping problem, in which nodes of an intercommunication network share information initially given to each one of them according to a communication protocol by rounds. We consider two types of communication protocols: vertex-disjoint path mode, and edge-disjoint path mode. We give a general lower bound on the complexity of gossiping algorithms in terms of the isoperimetric function of the graph. We focus on Cayley graphs and give optimal algorithms for subclasses of Cayley graphs and, in particular, for circulant graphs. 

Keywords: Gossiping, isoperimetric function, Cayley graphs, circulant
graphs, cube. MSC (2010): 05C85, 68R10.

Downloads

Download data is not yet available.

Author Biography

Romain Gay, ENS Cachan, Paris



Downloads

How to Cite

Gay, R. (2014). Gossiping in circulant graphs. Reports@SCM, 1(1), 39–53. Retrieved from https://revistes.iec.cat/index.php/reports/article/view/120174

Issue

Section

Articles