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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
RegDem translates SASS code to spill registers to shared memory, increasing occupancy and delivering 9% geometric mean speedup over nvcc with peaks of 18%.
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.
-
RegDem: Increasing GPU Performance via Shared Memory Register Spilling
RegDem translates SASS code to spill registers to shared memory, increasing occupancy and delivering 9% geometric mean speedup over nvcc with peaks of 18%.