Аноним

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

Материал из WEGA
нет описания правки
(Новая страница: «'''Circular-arc graph''' --- граф дуг окружности. A '''circular-arc graph''' is the intersection graph of a family of arcs on a circle; that is, f…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Circular-arc graph''' --- граф дуг окружности.  
'''Circular-arc graph''' — ''[[граф дуг окружности]].''


A '''circular-arc graph''' is the intersection graph of a family of arcs on a
A '''circular-arc graph''' is the [[intersection graph]] of a family of [[arc|arcs]] on a
circle; that is, for each vertex <math>v_{i}</math> there is a (closed)
circle; that is, for each [[vertex]] <math>\,v_{i}</math> there is a (closed)
arc <math>a_{i}</math> of the circle such that <math>v_{i}</math> and <math>v_{j}</math> are adjacent
arc <math>\,a_{i}</math> of the circle such that <math>\,v_{i}</math> and <math>\,v_{j}</math> are [[adjacent vertices|adjacent]] if and only if <math>a_{i} \cap a_{j} \neq \emptyset</math>.
if and only if <math>a_{i} \cap a_{j} \neq \emptyset</math>.
 
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.