On the complexity of information spreading in dynamic networks

• المؤلفون الرئيسيون: Dutta, Chinmoy, Pandurangan, Gopal, Rajaraman, Rajmohan, Sun, Zhifeng, Viola, Emanuele
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: Conference or Workshop Item
• اللغة: English
• منشور في: 2015
• الموضوعات: DRNTU::Science::Mathematics::Discrete mathematics::Algorithms
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/106636; http://hdl.handle.net/10220/25043; http://www.scopus.com/record/display.url?eid=2-s2.0-84876015544&origin=inward&txGid=C00E313D39DE2E098A6CDB1A0981DEA2.aqHV0EoE4xlIF3hgVWgA%3a2
• المؤسسة: Nanyang Technological University

We study how to spread k tokens of information to every node on an n-node dynamic network, the edges of which are changing at each round. This basic gossip problem can be completed in O(n + k) rounds in any static network, and determining its complexity in dynamic networks is central to understandin...