Finding Large Independent Sets in Polynomial Expected Time
From MaRDI portal
Recommendations
- Finding large independent sets in polynomial expected time
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Finding a Maximum Independent Set in a Sparse Random Graph
- Heuristics for semirandom graph problems
- Coloring k-colorable semirandom graphs in polynomial expected time via semidefinite programming
Cited in
(12)- Heuristics for semirandom graph problems
- Faster exponential-time algorithms for approximately counting independent sets
- Approximating independent set in perturbed graphs
- The resolution complexity of independent sets and vertex covers in random graphs
- On the independent set problem in random graphs
- Exponential Time Complexity of Weighted Counting of Independent Sets
- Finding a Maximum Independent Set in a Sparse Random Graph
- Finding large independent sets in polynomial expected time
- Introduction to Semirandom Models
- Constructing concrete hard instances of the maximum independent set problem
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- On finding randomly planted cliques in arbitrary graphs
This page was built for publication: Finding Large Independent Sets in Polynomial Expected Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3412105)