2 papers
cs.DM2026
Convex Recoloring of General Graphs: Formulations, Polyhedra, and Computational Experiments
Boyue Lin, Phablo F. S. Moura, Roel Leus
A vertex coloring of a graph is convex if the vertices of each color induce a connected subgraph. In the convex recoloring problem (CR), the goal is to find a convex coloring while…
cs.GT2023
Algorithmic Solutions for Maximizing Shareable Costs
Rong Zou, Boyue Lin, Marc Uetz +1
This paper addresses the optimization problem to maximize the total costs that can be shared among a group of agents, while maintaining stability in the sense of the core constrain…