Selected combinatorial problems through the prism of random intersection graphs models

DOI10.1007/978-3-031-30448-4_28MaRDI QIDQ6057306

Sotiris E. Nikoletseas, Paul G. Spirakis, Christoforos L. Raptopoulos

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Maximum cliques in graphs with small intersection number and random intersection graphs
• Secure communication over radio channels
• 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
• Algorithms and Computation

This page was built for publication: Selected combinatorial problems through the prism of random intersection graphs models