Information spreading in dynamic graphs-Reference-Cited by-同舟云学术

Information spreading in dynamic graphs

Published:2014-06-06 Issue:1 Volume:28 Page:55-73
ISSN:0178-2770
Container-title:Distributed Computing
language:en
Short-container-title:Distrib. Comput.

Author:

Clementi Andrea,Silvestri Riccardo,Trevisan Luca

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00446-014-0219-2.pdf

Reference33 articles.

1. Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs, Chap. 14 (1999). http://www.stat.berkeley.edu/aldous/RWG/book.html

2. Avin, C., Koucky, M., Lotker, Z.: How to explore a fast-changing world. In: Proceedings of 35th ICALP’08, LNCS, vol. 5125, pp. 121–132 (2008)

3. Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocation. SIAM J. Comput. 29(1), 180–200 (1999)

4. Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. Distrib. Comput. 24(1), 31–44 (2011)

5. Becchetti, L., Clementi, A.E.F., Pasquale, F., Resta, G., Santi, P., Silvestri, R.: Information spreading in opportunistic networks is fast. arXiv:1107.5241v1 (2011)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Addressable Quantum Gates;ACM Transactions on Quantum Computing;2023-04-24

2. Linking the mixing times of random walks on static and dynamic random graphs;Stochastic Processes and their Applications;2022-11

3. Information conduction and convection in noiseless Vicsek flocks;Physical Review E;2022-07-21

4. An Effective Data Structure for Contact Sequence Temporal Graphs;2021 IEEE Symposium on Computers and Communications (ISCC);2021-09-05

5. Mitigation of cascading failures in complex networks;Scientific Reports;2020-09-30