Аноним

2-3 Brother tree: различия между версиями

Материал из WikiGrapp
нет описания правки
(Новая страница: «'''2-3 Brother tree''' --- 2-3-братское дерево. A '''2-3 brother tree''' is a ''2-3 tree''satisfying an additional brother property: except for the s…»)
 
Нет описания правки
Строка 1: Строка 1:
'''2-3 Brother tree''' --- 2-3-братское дерево.  
'''2-3 Brother tree''' — [[2-3-Братское дерево|2-3-братское дерево]].  


A '''2-3 brother tree''' is a ''2-3 tree''satisfying an additional
A '''2-3 brother tree''' is a ''2-3 tree''satisfying an additional
brother property: except for the sons of a binary root, each binary
brother property: except for the [[son|sons]] of a binary [[root]], each binary [[node]] has a ternary [[brother of a vertex|brother]]. Obviously, the class of 2-3 brother trees
node has a ternary brother. Obviously, the class of 2-3 brother trees
is properly contained in the class of 2-3 trees.
is properly contained in the class of 2-3 trees.
==Литература==
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.