Articulation set: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Articulation set''' --- множество сочленения. Given a hypergraph <math>{\mathcal E} = (V, \{E_{1}, \ldots, E_{m}\})</math>, a set <math>A \…») |
KEV (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
'''Articulation set''' | '''Articulation set''' — ''[[множество сочленения]].'' | ||
Given a hypergraph <math>{\mathcal E} = (V, \{E_{1}, \ldots, E_{m}\})</math>, a set <math>A \subseteq V</math> | Given a [[hypergraph]] <math>{\mathcal E} = (V, \{E_{1}, \ldots, E_{m}\})</math>, a set <math>A \subseteq V</math> | ||
is an '''articulation set''' for <math>{\mathcal E}</math> if <math>A = E_{1} \cap E_{2}</math> for some | is an '''articulation set''' for <math>{\mathcal E}</math> if <math>A = E_{1} \cap E_{2}</math> for some | ||
pair of hyperedges <math>E_{1}, E_{2} \in {\mathcal E}</math> and <math>{\mathcal E}[V \setminus | pair of hyperedges <math>E_{1}, E_{2} \in {\mathcal E}</math> and <math>{\mathcal E}[V \setminus | ||
A]</math> has more connected components than <math>{\mathcal E}</math>. | A]</math> has more connected components than <math>{\mathcal E}</math>. | ||
Версия от 11:25, 9 декабря 2011
Articulation set — множество сочленения.
Given a hypergraph [math]\displaystyle{ {\mathcal E} = (V, \{E_{1}, \ldots, E_{m}\}) }[/math], a set [math]\displaystyle{ A \subseteq V }[/math] is an articulation set for [math]\displaystyle{ {\mathcal E} }[/math] if [math]\displaystyle{ A = E_{1} \cap E_{2} }[/math] for some pair of hyperedges [math]\displaystyle{ E_{1}, E_{2} \in {\mathcal E} }[/math] and [math]\displaystyle{ {\mathcal E}[V \setminus A] }[/math] has more connected components than [math]\displaystyle{ {\mathcal E} }[/math].