Pages that link to "Item:Q3629470"
From MaRDI portal
The following pages link to Finding a Maximum Independent Set in a Sparse Random Graph (Q3629470):
Displaying 7 items.
- On the independent set problem in random graphs (Q2804023) (← links)
- All maximal independent sets and dynamic dominance for sparse graphs (Q2930264) (← links)
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method (Q3376664) (← links)
- On independent sets in random graphs (Q3452727) (← links)
- Independent sets in random sparse graphs (Q3701457) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479377) (← links)
- How to hide a clique? (Q6614612) (← links)