Researchers have solved the frb100-40 benchmark, a challenge that remained open for over two decades. A new optimality certificate proves that the maximum independent-set size is 100 and the minimum vertex-cover size is 3,900 for the graph. Experiments evaluating repair operators showed no significant acceleration compared to existing methods, and a comparative analysis found that a group-aware CSP pipeline outperformed LibMVC-NuMVC on a smaller suite of problems. AI
RANK_REASON The cluster describes a research paper detailing the solution to a long-standing computational benchmark. [lever_c_demoted from research: ic=1 ai=0.4]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →