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.
and Jacobs, David P
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.NE 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
-
Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring
Empirical classification of search landscapes for two combinatorial problems across graph classes and two neighborhoods.