메뉴 건너뛰기




Volumn 309, Issue 16, 2009, Pages 5130-5140

Connectivity of the uniform random intersection graph

Author keywords

Key predistribution; Random intersection graph; Wireless sensor network

Indexed keywords

FINITE SET; GRAPH G; KEY PREDISTRIBUTION; NETWORK GRAPH; POSITIVE REAL; RANDOM GRAPHS; RANDOM INTERSECTION GRAPH; RANDOM INTERSECTION GRAPHS; SECURITY OF WIRELESS SENSOR NETWORKS;

EID: 67651171221     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2009.03.042     Document Type: Article
Times cited : (88)

References (12)
  • 1
    • 33644858199 scopus 로고    scopus 로고
    • Efficiently covering complex networks with cliques of similar vertices
    • Behrisch M., and Taraz A. Efficiently covering complex networks with cliques of similar vertices. Theoret. Comput. Sci. 355 (2006) 37-47
    • (2006) Theoret. Comput. Sci. , vol.355 , pp. 37-47
    • Behrisch, M.1    Taraz, A.2
  • 2
    • 61349175162 scopus 로고    scopus 로고
    • Component evolution in a secure wireless sensor network
    • Bloznelis M., Jaworski J., and Rybarczyk K. Component evolution in a secure wireless sensor network. Networks 53 (2008) 19-26
    • (2008) Networks , vol.53 , pp. 19-26
    • Bloznelis, M.1    Jaworski, J.2    Rybarczyk, K.3
  • 4
    • 67651190885 scopus 로고    scopus 로고
    • R. Di Pietro, L.V. Mancini, A. Mei, A. Panconesi, J. Radhakrishnan, How to design connected sensor networks that are provably secure, presented at SecureComm 2006, http://delis.upb.de/paper/DELIS-TR-0360.pdf
    • R. Di Pietro, L.V. Mancini, A. Mei, A. Panconesi, J. Radhakrishnan, How to design connected sensor networks that are provably secure, presented at SecureComm 2006, http://delis.upb.de/paper/DELIS-TR-0360.pdf
  • 7
    • 0034391563 scopus 로고    scopus 로고
    • Random intersection graphs when m = ω (n): an equivalence theorem relating the evolution of the G (n, m, p) and G (n, p) models
    • Fill J.A., Scheinerman E.R., and Singer-Cohen K.B. Random intersection graphs when m = ω (n): an equivalence theorem relating the evolution of the G (n, m, p) and G (n, p) models. Random Structures Algorithms 16 (2000) 156-176
    • (2000) Random Structures Algorithms , vol.16 , pp. 156-176
    • Fill, J.A.1    Scheinerman, E.R.2    Singer-Cohen, K.B.3
  • 8
    • 33744953201 scopus 로고    scopus 로고
    • Two models of random intersection graphs for classification
    • Studies in Classification. Optiz O., and Schwaiger M. (Eds), Springer, Berlin
    • Godehardt E., and Jaworski J. Two models of random intersection graphs for classification. In: Optiz O., and Schwaiger M. (Eds). Studies in Classification. Data Analysis and Knowledge Organization vol. 22 (2003), Springer, Berlin 67-82
    • (2003) Data Analysis and Knowledge Organization , vol.22 , pp. 67-82
    • Godehardt, E.1    Jaworski, J.2
  • 9
    • 56749176568 scopus 로고    scopus 로고
    • Random intersection graphs and classification
    • Studies in Classification. Lens H.J., and Decker R. (Eds), Springer, Berlin
    • Godehardt E., Jaworski J., and Rybarczyk K. Random intersection graphs and classification. In: Lens H.J., and Decker R. (Eds). Studies in Classification. Data Analysis and Knowledge Organization vol. 33 (2007), Springer, Berlin 67-74
    • (2007) Data Analysis and Knowledge Organization , vol.33 , pp. 67-74
    • Godehardt, E.1    Jaworski, J.2    Rybarczyk, K.3
  • 10
    • 33747794115 scopus 로고    scopus 로고
    • The degree of a typical vertex in generalized random intersection graph models
    • Jaworski J., Karoński M., and Stark D. The degree of a typical vertex in generalized random intersection graph models. Discrete Math. 306 (2006) 2152-2165
    • (2006) Discrete Math. , vol.306 , pp. 2152-2165
    • Jaworski, J.1    Karoński, M.2    Stark, D.3
  • 11
    • 33744963843 scopus 로고
    • Ph.D. Thesis, Johns Hopkins University, Baltimore, Maryland
    • K.B. Singer-Cohen, Random Intersection Graphs, Ph.D. Thesis, Johns Hopkins University, Baltimore, Maryland, 1995
    • (1995) Random Intersection Graphs
    • Singer-Cohen, K.B.1
  • 12
    • 11144302612 scopus 로고    scopus 로고
    • The vertex degree distribution of random intersection graphs
    • Stark D. The vertex degree distribution of random intersection graphs. Random Structures Algorithms 24 (2004) 249-258
    • (2004) Random Structures Algorithms , vol.24 , pp. 249-258
    • Stark, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.