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

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Cutset''' --- разрез, сечение. A set of points (edges) in a connected graph whose removal results in a disconnected graph is called a '''cutset'''…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Cutset''' --- разрез, сечение.  
'''Cutset''' ''[[разрез]], [[сечение]].''


A set of points (edges) in a connected graph whose removal results in
A set of [[point|points]] ([[edge|edges]]) in a [[connected graph]] whose removal results in a [[disconnected graph]] is called a '''cutset'''. A ''[[cutpoint]]'' ('''[[cut-edge]]''') is a point (edge) forming a cutset itself.
a disconnected graph is called a '''cutset'''. A '' cutpoint'' ('''cut-edge''') is a point
(edge) forming a cutset itself.


Other name is '''Separating set'''.
Other name is '''[[Separating set]]'''.
 
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.

Текущая версия от 12:50, 20 ноября 2019

Cutsetразрез, сечение.

A set of points (edges) in a connected graph whose removal results in a disconnected graph is called a cutset. A cutpoint (cut-edge) is a point (edge) forming a cutset itself.

Other name is Separating set.

Литература

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