frb100-40 After Two Decades: An Optimality Certificate and a Preregistered Search Study
Read the original on arXiv AI →The paper presents a verified solution to the long‑standing frb100‑40 benchmark, providing a 100‑vertex independent set and a partition into 100 cliques of size 40, thereby proving the maximum independent‑set size is 100 and the minimum vertex‑cover size is 3,900. A preregistered experimental campaign of 8,668 runs evaluated new repair operators, finding no performance improvement over the baseline ULSA algorithm. Additional comparisons with other solvers (LibMVC‑NuMVC, group‑aware CSP pipeline) and exhaustive enumeration confirm the optimality certificate and characterize the search barrier for this instance.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.