Аноним

Clique cover: различия между версиями

Материал из WikiGrapp
нет описания правки
(Новая страница: «'''Clique cover''' --- кликовое покрытие. Let <math>F</math> be a family of cliques. By a '''clique cover''' we mean a spanning subgraph of <math>G…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Clique cover''' --- кликовое покрытие.  
'''Clique cover''' — ''[[кликовое покрытие]].''


Let <math>F</math> be a family of cliques. By a '''clique cover''' we mean a spanning
Let <math>\,F</math> be a family of cliques. By a '''clique cover''' we mean a [[spanning subgraph]] of <math>\,G</math>, each component of which is a member of <math>\,F</math>. With each
subgraph of <math>G</math>, each component of which is a member of <math>F</math>. With each
element <math>\,\alpha</math> of <math>\,F</math> we associate an indeterminate (or [[weight (of a vertex)|weight]]) <math>\,w_{\alpha}</math>, and with each cover <math>\,C</math> of <math>\,G</math> we assosiate the weight <math>w(C) = \prod_{\alpha \in C}w_{\alpha}</math>.
element <math>\alpha</math> of <math>F</math> we associate an indeterminate (or weight)
 
<math>w_{\alpha}</math>, and with each cover <math>C</math> of <math>G</math> we assosiate the weight
==Литература==
<math>w(C) = \prod_{\alpha \in C}w_{\alpha}</math>.
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.