Аноним

Balanced hypergraph: различия между версиями

Материал из WikiGrapp
нет описания правки
Нет описания правки
Нет описания правки
 
Строка 3: Строка 3:
A [[hypergraph]] is a '''balanced hypergraph''' if every [[circuit]] of odd length is ''balanced''. A hypergraph is a '''totally balanced hypergraph''' if every
A [[hypergraph]] is a '''balanced hypergraph''' if every [[circuit]] of odd length is ''balanced''. A hypergraph is a '''totally balanced hypergraph''' if every
circuit is balanced.
circuit is balanced.
==Литература==
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.