Efficient broadcast on random geometric graphs
暂无分享,去创建一个
Thomas Sauerwald | Tobias Friedrich | Robert Elsässer | Milan Bradonjic | Alexandre Stauffer | M. Bradonjic | T. Friedrich | Alexandre O. Stauffer | Thomas Sauerwald | Robert Elsässer
[1] Thomas Sauerwald,et al. Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs , 2007, STACS.
[2] Isaac Balberg. Continuum Percolation , 2009, Encyclopedia of Complexity and Systems Science.
[3] Alan M. Frieze,et al. The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..
[4] J. Dall,et al. Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[5] B. Pittel. On spreading a rumor , 1987 .
[6] Xin Wang,et al. Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks , 2007, ISAAC.
[7] Catherine H. Yan,et al. Random Geometric Graph Diameter in the Unit Ball , 2006, Algorithmica.
[8] Alfredo Navarra,et al. Managing Random Sensor Networks by means of Grid Emulation , 2006, Networking.
[9] Gregory J. Pottie,et al. Wireless integrated network sensors , 2000, Commun. ACM.
[10] Chen Avin,et al. On the Cover Time of Random Geometric Graphs , 2005, ICALP.
[11] Chen Avin,et al. On the cover time and mixing time of random geometric graphs , 2007, Theor. Comput. Sci..
[12] Thomas Sauerwald,et al. On the runtime and robustness of randomized broadcasting , 2006, Theor. Comput. Sci..
[13] Eli Upfal,et al. Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.
[14] Alan M. Frieze,et al. The cover time of the giant component of a random graph , 2008, Random Struct. Algorithms.