Аноним

Threshold graph: различия между версиями

Материал из WEGA
Новая страница: «'''Threshold graph''' --- пороговый граф. A graph is called ''' threshold''', if there is a non-negative weight function on its vertices such that eac…»
(Новая страница: «'''Threshold graph''' --- пороговый граф. A graph is called ''' threshold''', if there is a non-negative weight function on its vertices such that eac…»)
 
(нет различий)
4189

правок