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.
Analysis of a gray-box operator for vertex cover , isbn =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.NE 3years
2026 3verdicts
UNVERDICTED 3representative 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.
Empirical classification of search landscapes for two combinatorial problems across graph classes and two neighborhoods.
citing papers explorer
-
Local Search on Vertex Coloring for Bipartite Graphs
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.
-
Gray-Box Optimization and the Vertex Coloring Problem
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.
-
Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring
Empirical classification of search landscapes for two combinatorial problems across graph classes and two neighborhoods.