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

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Biconnected component''' --- компонента двусвязности, блок. A '''biconnected component''' of a graph <math>G</math> is a maximal set o…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''Biconnected component''' --- компонента двусвязности, блок.  
'''Biconnected component''' — ''[[компонента двусвязности]], [[блок]].''


A '''biconnected component''' of a graph <math>G</math> is a maximal set of edges such that any
A '''biconnected component''' of a [[graph, undirected graph, nonoriented graph|graph]] <math>G</math> is a maximal set of [[edge|edges]] such that any
two edges in the set lie on a common cycle. A '''block'''
two edges in the set lie on a common [[cycle]]. A '''[[block]]'''
is a ''bridge(2)''or a ''biconnected component''of <math>G</math>.
is a ''[[bridge]](2)'' or a ''biconnected component'' of <math>G</math>.
==See also==  
==See also==  
*''Articulation point, 2-Connected graph, Block''.
* ''[[Articulation point]],''
* ''[[2-Connected graph]],''
* ''[[Block]].''
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.

Текущая версия от 16:31, 23 октября 2018

Biconnected componentкомпонента двусвязности, блок.

A biconnected component of a graph [math]\displaystyle{ G }[/math] is a maximal set of edges such that any two edges in the set lie on a common cycle. A block is a bridge(2) or a biconnected component of [math]\displaystyle{ G }[/math].

See also

Литература

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