Selected Combinatorial Properties of Random Intersection Graphs

DOI10.1007/978-3-642-24897-9_15zbMath1349.05317OpenAlexW10200832MaRDI QIDQ3098045

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

Publication date: 11 November 2011

Published in: Algebraic Foundations in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24897-9_15

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems ⋮ A spectral algorithm for finding maximum cliques in dense random intersection graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Degree distribution of a typical vertex in a general random intersection graph
• Large independent sets in general random intersection graphs
• Connectivity of the uniform random intersection graph
• Component Evolution in General Random Intersection Graphs
• The cover time of sparse random graphs
• Expander Properties and the Cover Time of Random Intersection Graphs
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• On Random Intersection Graphs: The Subgraph Problem
• Random Geometric Graphs
• The vertex degree distribution of random intersection graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Automata, Languages and Programming
• Algorithms and Computation

This page was built for publication: Selected Combinatorial Properties of Random Intersection Graphs