On Random Intersection Graphs: The Subgraph Problem
Combinatorics, Probability and Computing
The vertex degree distribution of random intersection graphs
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I
Random intersection graphs with tunable degree distribution and clustering
Probability in the Engineering and Informational Sciences
On the existence of hamiltonian cycles in random intersection graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Expander properties and the cover time of random intersection graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Maximum cliques in graphs with small intersection number and random intersection graphs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A guided tour in random intersection graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Constructions of independent sets in random intersection graphs
Theoretical Computer Science
| Hi-index | 5.23 |
In the uniform random intersection graphs model, denoted by G"n","m","@l, to each vertex v we assign exactly @l randomly chosen labels of some label set M of m labels and we connect every pair of vertices that has at least one label in common. In this model, we estimate the independence number @a(G"n","m","@l), for the wide range m=@?n^@a@?,@a