23 citations · 33 across the 11 of their papers we have counts for
Showing 2025 · cs.DMShow all
2 papers · 2 filters
cs.DM2025
Finding happiness by evolutionary algorithms
Mohammad Hadi Shekarriz, Dhananjay Thiruvady, Asef Nazari
A recent line of research concerns the problem of soft happy colouring (SHC), which requires that a partially coloured graph be extended to a complete colouring to maximise local a…
cs.DM2025
Local Search Improvements for Soft Happy Colouring
Mohammad Hadi Shekarriz, Dhananjay Thiruvady, Asef Nazari +1
For and a coloured graph , a vertex is -happy if at least of its neighbours have the same colour as . Soft happy colouring of a part…