Cutset
Материал из WikiGrapp
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.