7 citations · 10 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2014
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
S. Bianchi, M. Escalante, G. Nasini +1
We study the Lovász-Schrijver lift-and-project operator () based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of gr…
cs.DM2014★ 7 cited
An exact DSatur-based algorithm for the Equitable Coloring Problem
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severín
This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifi…