23 citations · 73 across the 16 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
The Identifying Code problem on -tidy graphs
Graciela Nasini, Pablo Torres
In this paper we first analyze the behaviour of the identifying code number under union and join operations in graphs. This study forced us to analyze three new parameters related…
cs.DM2013★ 23 cited
A DSATUR-based algorithm for the Equitable Coloring Problem
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severin
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based o…