Four MILP formulations for convex recoloring on general graphs are introduced, with experiments indicating that a branch-and-cut algorithm using the representatives formulation performs best overall.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Convex Recoloring of General Graphs: Formulations, Polyhedra, and Computational Experiments
Four MILP formulations for convex recoloring on general graphs are introduced, with experiments indicating that a branch-and-cut algorithm using the representatives formulation performs best overall.