Two models of random intersection graphs and their applications

Electronic Notes in Discrete Mathematics

Volumn 10, Issue , 2001, Pages 129-132

  Godehardt, Erhard ^a   Jaworski, Jerzy ^b  

^a HEINRICH HEINE UNIVERSITY   (Germany)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846666519     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00377-4     Document Type: Article

References (6)

1. Bock, H.H. (1996): Probabilistic models in cluster analysis. Computational Statistics and Data Analysis, 23, 5-28.
2. Godehardt, E. (1990): Graphs as structural models. Vieweg, Braunschweig.
3. Godehardt, E., Jaworski, J. (1996): On the connectivity of a random graph. Random Structures and Algorithms, 9, 137-161.
4. Jaworski, J., Palka, Z. (2001, to appear): Remarks on a General Model of a Random Digraph. Ars Combinatoria.
5. Jaworski, J., Smit, I. (1987): On a Random Digraph. Annals of Discrete Mathematics, 33, 111-127.
6. Karoński, M., Scheinerman, E.R., Singer-Cohen, K.B. (1999): On Random Intersection Graphs: The Subgraph Problem. Combinatorics, Probability and Computing, 8, 131-159.