Local search can return arbitrarily bad colorings on general bipartite graphs, but a gray-box operator that biases against rare colors solves complete bipartite graphs in Θ(n log n) expected time.
In: Proceed- ings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
Gray-box operators enable RLS to achieve expected O(n log n) runtime for proper 2-colorings in bipartite graphs, unlike standard (1+1) EA which requires plateau guidance.