M. H. Shekarriz

activity

20242026

collaborators

4 papers

cs.SI2026

Overcoming Tight Constraints in Soft Happy Colouring

Mohammad Hadi Shekarriz, Asef Nazari, Dhananjay Thiruvady

The Soft Happy Colouring (SHC) problem, a mathematical framework for identifying homophilic network structures, seeks to maximise the number of $I ¨ $ -happy vertices, i.e., vertices…

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 $0 \leq I ¨ \leq 1$ and a coloured graph $G$ , a vertex $v$ is $I ¨ $ -happy if at least $I ¨ deg (v)$ of its neighbours have the same colour as $v$ . Soft happy colouring of a p…

cs.DM2024

Soft happy colourings and community structure of networks

Mohammad H. Shekarriz, Dhananjay Thiruvady, Asef Nazari +1

For $0 < I ¨ \leq 1$ , a $I ¨ $ -happy vertex $v$ in a coloured graph $G$ has at least $I ¨ \cdot deg (v)$ same-colour neighbours, and a $I ¨ $ -happy colouring (aka soft happy colourin…