Deterministic Gossiping with a Periodic Protocol
A sequence of allowable gossips between pairs of agents in a group is complete if the gossip graph which the sequence generates is a connected spanning subgraph of the graph of all allowable gossip pairs; such a sequence is minimally complete if there is
|Collections||ANU Research Publications|
|Source:||IEEE Conference on Decision and Control 2010 Proceedings|
|01_Mou_Deterministic_Gossiping_with_a_2010.pdf||109.58 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.