6 citations · 6 across the 3 of their papers we have counts for
4 papers · 1 filter
An integer programming approach for solving a generalized version of the Grundy domination number
Manoel Campêlo, Daniel Severín
A sequence of vertices in a graph is called a legal dominating sequence if every vertex in the sequence dominates at least one vertex not dominated by those that precede it, and at…
Polyhedral study of the Convex Recoloring problem
Manoel Campêlo, Phablo F. S. Moura, Joel C. Soares
A coloring of the vertices of a connected graph is convex if each color class induces a connected subgraph. We address the convex recoloring (CR) problem defined as follows. Given…
The polytope of legal sequences
Manoel Campêlo, Daniel Severín
A sequence of vertices in a graph is called a \emph{(total) legal dominating sequence} if every vertex in the sequence (total) dominates at least one vertex not dominated by those…
A Lagrangian Relaxation for the Maximum Stable Set Problem
Manoel Campelo, Ricardo C. Correa
We propose a new integer programming formulation for the problem of finding a maximum stable set of a graph based on representatives of stable sets. In addition, we investigate exa…