9 citations · 11 across the 7 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.LG2021★ 1 cited
Exploring dual information in distance metric learning for clustering
Rodrigo Randel, Daniel Aloise, Alain Hertz
Distance metric learning algorithms aim to appropriately measure similarities and distances between data points. In the context of clustering, metric learning is typically applied…
math.CO2021
Upper bounds on the average number of colors in the non-equivalent colorings of a graph
Alain Hertz, Hadrien Mélot, Sébastien Bonte +2
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition o…
math.CO2021★ 1 cited
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
Alain Hertz, Hadrien Mélot, Sébastien Bonte +1
We study the average number of colors in the non-equivalent colorings of a graph . We show some general properties of this graph invariant and determine its val…