Pages that link to "Item:Q2401330"

The following pages link to Finding near-optimal independent sets at scale (Q2401330):

Displaying 8 items.

• Reducing graph coloring to clique search (Q326946) (← links)
• Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
• A genetic algorithm for the maximum 2-packing set problem (Q2019714) (← links)
• Finding near-optimal independent sets at scale (Q2401330) (← links)
• Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
• (Q5232553) (redirect page) (← links)
• A fast approximation algorithm for the maximum 2-packing set problem on planar graphs (Q6110632) (← links)
• A differentiable approach to the maximum independent set problem using dataless neural networks (Q6488722) (← links)