Generalising the maximum independent set algorithm via Boolean networks

Maximilien Gadouleau, David C. Kutner

A simple greedy algorithm to find a maximal independent set (MIS) in a graph starts with the empty set and visits every vertex, adding it to the set if and only if none of its neig…