Clique cover

Clique cover — кликовое покрытие.

Let $\,F$ be a family of cliques. By a clique cover we mean a spanning subgraph of $\,G$, each component of which is a member of $\,F$. With each element $\,\alpha$ of $\,F$ we associate an indeterminate (or weight) $\,w_{\alpha}$, and with each cover $\,C$ of $\,G$ we assosiate the weight $w(C) = \prod_{\alpha \in C}w_{\alpha}$.

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.