Filling MIS Vertices by Myopic Luminous Robots

Subhajit Pramanick, Sai Vamshi Samala, Debasish Pattanayak +1

We present the problem of finding a maximal independent set (MIS) (named as \emph{MIS Filling problem}) of an arbitrary connected graph having $n$ vertices with luminous myopic mob…