Information spreading in dynamic graphs

DOI10.1145/2332432.2332439MaRDI QIDQ6829898zbMATH OpenFDO

Authors Andrea Clementi, Riccardo Silvestri, Luca Trevisan

Publication date 5 December 2014

Published in Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2332432.2332439

zbMATH Keywords

dynamic graphsflooding protocolsMarkov chainsmobility models

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distributed systems (68M14) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cited in

(2)

• Rumors with changing credibility
• Smoothed analysis of information spreading in dynamic networks

This page was built for publication: Information spreading in dynamic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829898)