On the independence number and Hamiltonicity of uniform random intersection graphs

Theoretical Computer Science

Volumn 412, Issue 48, 2011, Pages 6750-6760

  Nikoletseas, S ^a,b   Raptopoulos, C ^a,b   Spirakis, P G ^a,b  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

Hamiltonian cycle; Independent set; Intersection graphs; Probabilistic methods; Random graphs

Indexed keywords

HAMILTONIAN CYCLE; INDEPENDENT SET; INTERSECTION GRAPHS; PROBABILISTIC METHODS; RANDOM GRAPHS;

GRAPHIC METHODS; HAMILTONIANS;

GRAPH THEORY;

EID: 80053935840     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.09.003     Document Type: Article

References (15)

1. N. Alon, and J.H. Spencer The Probabilistic Method second ed. 2000 John Wiley & Sons, Inc.
2. S.R. Blackburn, S. Gerke, Connectivity of the uniform random intersection graph, http://www.citebase.org/abstract?id=oai:arXiv.org:0805.2814, (2008).
3. M. Blonzelis Degree distribution of a typical vertex in a general random intersection graph Lithuanian Mathematical Journal 48 1 2008 38 45
4. V. Dani, C. Moore, Independent sets in random graphs from the weighted second moment method, arXiv:1011.0180v2 [cs.CC].
5. M. Deijfen, W. Kets, Random intersection graphs with tunable degree distribution and clustering, http://www2.math.su.se/~mia/rig.pdf.
6. C. Efthymiou, P.G. Spirakis, On the existence of Hamilton cycles in random intersection graphs, in: The Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP, 2005, pp. 690701. (Pubitemid 41436139)
7. J.A. Fill, E.R. Sheinerman, K.B Singer-Cohen, Random intersection graphs when m = ω (n): an equivalence theorem relating the evolution of the G (n, m, p) and G (n, p) models, http://citeseer.nj.nec.com/fill98random.html.
8. E. Godehardt, and J. Jaworski Two models of random intersection graphs for classification O. Opitz, M. Schwaiger, Studies in Classification, Data Analysis and Knowledge Organisation 2002 Springer Verlag Berlin, Heidelberg, New York 67 82
9. M. Karoski, E.R. Scheinerman, and K.B. Singer-Cohen On random intersection graphs: the subgraph problem Combinatorics, Probability and Computing Journal 8 1999 131 159 (Pubitemid 129640074)
10. S. Nikoletseas, C. Raptopoulos, and P. Spirakis The existence and efficient construction of large independent sets in general random intersection graphs The Proceedings of the 31st International Colloquium on Automata, Languages and Programming ICALP Lecture Notes in Computer Science 2004 Springer Verlag 1029 1040
11. S. Nikoletseas, C. Raptopoulos, P.G. Spirakis, Expander properties and the cover time of symmetric random intersection graphs, in: The Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, 2007.
12. R. Di Pietro, L.V. Mancini, A. Mei, A. Panconesi, J. Radhakrishnan, Sensor networks that are provably resilient, in: The Proceedings of IEEE, 2nd International Conference on Security and Privacy in Communication Networks (SecureComm), 2004.
13. C. Raptopoulos, P.G. Spirakis, Simple and efficient greedy algorithms for Hamilton cycles in random intersection graphs, in: The Proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC, 2005, pp. 493504. (Pubitemid 43856276)
14. K.B. Singer-Cohen, Random intersection graphs, Ph.D. Thesis, John Hopkins University, 1995.
15. D. Stark The vertex degree distribution of random intersection graphs Random Structures & Algorithms 24 3 2004 249 258 (Pubitemid 40030694)