Constructions of independent sets in random intersection graphs
From MaRDI portal
Publication:2637343
DOI10.1016/j.tcs.2014.01.006zbMath1282.68193MaRDI QIDQ2637343
Publication date: 11 February 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.006
68Q25: Analysis of algorithms and problem complexity
05C80: Random graphs (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68W20: Randomized algorithms
05C62: Graph representations (geometric and intersection representations, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
On the Chromatic Index of Random Uniform Hypergraphs, The chromatic number of random intersection graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the independence number and Hamiltonicity of uniform random intersection graphs
- Component evolution in random intersection graphs
- On the independence number of random graphs
- Degree distribution of a typical vertex in a general random intersection graph
- Large independent sets in general random intersection graphs
- A note on the component structure in random intersection graphs with tunable clustering
- Degree and clustering coefficient in sparse random intersection graphs
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- Equivalence of a random intersection graph and G (n ,p )
- The Degree Distribution in Random Intersection Graphs
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- Cliques in random graphs
- On Random Intersection Graphs: The Subgraph Problem
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Component evolution in a secure wireless sensor network
- Random Graphs
