Selected combinatorial problems through the prism of random intersection graphs models
From MaRDI portal
Recommendations
- Selected Combinatorial Properties of Random Intersection Graphs
- On Some Combinatorial Properties of Random Intersection Graphs
- On Random Intersection Graphs: The Subgraph Problem
- A guided tour in random intersection graphs
- The intersection graph of random sets
- Publication:4729111
- On Connectivity in a General Random Intersection Graph
- The chromatic number of random intersection graphs
- Analytic combinatorics on random graphs
- On randomly generated intersecting hypergraphs
Cites work
- Algorithms and Computation
- Equivalence of a random intersection graph and G (n ,p )
- On Random Intersection Graphs: The Subgraph Problem
- On the total variation distance between the binomial random graph and the random intersection graph
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Secret Swarm Unit Reactive k −Secret Sharing
- Secure communication over radio channels
Cited in
(3)
This page was built for publication: Selected combinatorial problems through the prism of random intersection graphs models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057306)