Intersection graph: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Intersection graph''' --- граф пересечений. The '''intersection graph''' of a set of items is a graph formed by associating each item with a vert…») |
(нет различий)
|
Текущая версия от 07:07, 24 мая 2011
Intersection graph --- граф пересечений.
The intersection graph of a set of items is a graph formed by associating each item with a vertex and adding an edge between two vertices if the associated items have a nonempty intersection. The containment graph is formed in a similar fashion, but there is an edge between two vertices if one of the items contains the other.