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
(9)- Heuristics for semirandom graph problems
- Faster exponential-time algorithms for approximately counting independent sets
- Approximating independent set in perturbed graphs
- Exponential Time Complexity of Weighted Counting of Independent Sets
- Finding Large Independent Sets in Polynomial Expected Time
- Finding a Maximum Independent Set in a Sparse Random Graph
- Exact and approximative algorithms for coloring G(n,p)
- Independent sets in graphs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
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 Q4418677)