On the independence number of random graphs
Discrete Mathematics
Algorithmic theory of random graphs
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
On Random Intersection Graphs: The Subgraph Problem
Combinatorics, Probability and Computing
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
Large independent sets in general random intersection graphs
Theoretical Computer Science
Random intersection graphs with tunable degree distribution and clustering
Probability in the Engineering and Informational Sciences
Equivalence of a random intersection graph and G(n,p)
Random Structures & Algorithms
On the independence number and Hamiltonicity of uniform random intersection graphs
Theoretical Computer Science
| Hi-index | 5.23 |
This paper concerns constructing independent sets in a random intersection graph. We concentrate on two cases of the model: a binomial and a uniform random intersection graph. For both models we analyse two greedy algorithms and prove that they find asymptotically almost optimal independent sets. We provide detailed analysis of the presented algorithms and give tight bounds on the independence number for the studied models. Moreover we determine the range of parameters for which greedy algorithms give better results for a random intersection graph than this is in the case of an Erdos-Renyi random graph G(n,p@?).