-
1
-
-
33644858199
-
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
-
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
-
-
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
-
-
-
-
5
-
-
41549165648
-
Redoubtable sensor networks
-
Di Pietro R., Mancini L.V., Mei A., Panconesi A., and Radhakrishnan J. Redoubtable sensor networks. ACM Trans. Inform. Systems Security 11 (2008) 1-22
-
(2008)
ACM Trans. Inform. Systems Security
, vol.11
, pp. 1-22
-
-
Di Pietro, R.1
Mancini, L.V.2
Mei, A.3
Panconesi, A.4
Radhakrishnan, J.5
-
7
-
-
0034391563
-
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
-
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
-
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
-
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
-
-
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
-
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
|