Author:
Bloznelis Mindaugas,Łuczak Tomasz
Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. S. Blackburn and S. Gerke, Connectivity of the uniform random intersection graph, Discrete Mathematics, 309 (2009), 5130–5140.
2. M. Bloznelis, J. Jaworski and K. Rybarczyk, Component evolution in a wireless sensor network, Networks, 53 (2009), 19–26.
3. B. Bollobás, Random Graphs, 2nd ed., Cambridge University Press (New York, 2001).
4. R. Di Pietro, L. V. Mancini, A. Mei, A. Panconesi and J. Radhakrishnan, Sensor networks that are provably resilient, in: Proc. 2nd IEEE Int. Conf. Security Privacy Emerging Areas Commun. Networks (SecureComm, 2006) (Baltimore, MD, 2006).
5. P. Erdős and A. Rényi, On the existence of a factor of degree one of a connected random graph, Acta Math. Acad. Sci. Hungar., 17 (1966), 359–368.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献