Просмотр кода страницы Minimum independent dominating set problem

'''Minimum independent dominating set problem''' --- задача о
минимальном независимом доминирующем множестве. 

Given a graph <math>G = (V,e)</math>, the '''minimum independent dominating set problem''' (or '''MIDS''') is the problem
of finding the smallest possible set <math>S \subseteq V</math> of vertices such
that for all <math>u \in V - S</math> there is <math>v \in S</math> for which <math>(u,v) \in
E</math>, and such that no two vertices in <math>S</math> are joined by an edge in <math>E</math>.
Variation in which the degree of <math>G</math> is bounded by a constant <math>B</math> is
denoted by MIDS-B.