Vertex cover, vertex covering

Материал из WikiGrapp
Перейти к навигации Перейти к поиску

Vertex cover, vertex covering --- вершинное покрытие.

A subset [math]\displaystyle{ V' \subseteq V }[/math] of a graph [math]\displaystyle{ G = (V,E) }[/math] such that for all edges [math]\displaystyle{ e = (u,v) \in E }[/math] we have [math]\displaystyle{ u \in V' }[/math] or [math]\displaystyle{ v \in V' }[/math].

See also

  • Vertex clique cover.