The following pages link to Algorithms and Computation (Q5897882):
Displaying 12 items.
- On the chromatic number of non-sparse random intersection graphs (Q519889) (← links)
- On the independence number and Hamiltonicity of uniform random intersection graphs (Q650910) (← links)
- Sharp thresholds for Hamiltonicity in random intersection graphs (Q708225) (← links)
- Expander properties and the cover time of random intersection graphs (Q1034533) (← links)
- An algorithm for finding Hamilton paths and cycles in random graphs (Q1099190) (← links)
- On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three (Q2930057) (← links)
- Selected Combinatorial Properties of Random Intersection Graphs (Q3098045) (← links)
- Colouring Non-sparse Random Intersection Graphs (Q3182958) (← links)
- On Some Combinatorial Properties of Random Intersection Graphs (Q3464482) (← links)
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs (Q3522870) (← links)
- MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems (Q6053474) (← links)
- Selected combinatorial problems through the prism of random intersection graphs models (Q6057306) (← links)
