Threshold graph: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Threshold graph''' --- пороговый граф. A graph is called ''' threshold''', if there is a non-negative weight function on its vertices such that eac…») |
(нет различий)
|
Текущая версия от 05:30, 4 августа 2011
Threshold graph --- пороговый граф.
A graph is called threshold, if there is a non-negative weight function on its vertices such that each stable (independent) set of vertices has the total weight at most 1, and each non-stable set of vertices has a total weight exceeding 1.