1,526
个编辑
更改
跳到导航
跳到搜索
第365行：
第365行： − +
→横截面 Transversals
A ''[[Transversal (combinatorics)|transversal]]'' (or "[[hitting set]]") of a hypergraph ''H'' = (''X'', ''E'') is a set <math>T\subseteq X</math> that has nonempty [[intersection (set theory)|intersection]] with every edge. A transversal ''T'' is called ''minimal'' if no proper subset of ''T'' is a transversal. The ''transversal hypergraph'' of ''H'' is the hypergraph (''X'', ''F'') whose edge set ''F'' consists of all minimal transversals of ''H''.
A ''[[Transversal (combinatorics)|transversal]]'' (or "[[hitting set]]") of a hypergraph ''H'' = (''X'', ''E'') is a set <math>T\subseteq X</math> that has nonempty [[intersection (set theory)|intersection]] with every edge. A transversal ''T'' is called ''minimal'' if no proper subset of ''T'' is a transversal. The ''transversal hypergraph'' of ''H'' is the hypergraph (''X'', ''F'') whose edge set ''F'' consists of all minimal transversals of ''H''.
超图<math>H = (X, E)</math>的'''横截集 transversal'''（或命中集 hitting set）是一个<math>T\subseteq X</math>集合，该集合与每条边都有非空的交集。如果<math>T</math>的真子集不是横截集，则称<math>T</math>为极小截集。<math>H </math>的横截超图是超图<math>（X， F）</math>，其边集<math>F</math>包含<math>H</math>的所有最小横截集。
超图<math>H = (X, E)</math>的'''横截集 transversal'''（或命中集 hitting set）是一个<math>T\subseteq X</math>集合，该集合与每条边都有非空的交集。如果<math>T</math>的真子集不是横截集，则称<math>T</math>为极小截集。<math>H </math>的横截超图是超图<math>（X, F）</math>，其边集<math>F</math>包含<math>H</math>的所有最小横截集。
Computing the transversal hypergraph has applications in [[combinatorial optimization]], in [[game theory]], and in several fields of [[computer science]] such as [[machine learning]], [[Index (database)|indexing of database]]s, the [[Boolean satisfiability problem|satisfiability problem]], [[data mining]], and computer [[program optimization]].
Computing the transversal hypergraph has applications in [[combinatorial optimization]], in [[game theory]], and in several fields of [[computer science]] such as [[machine learning]], [[Index (database)|indexing of database]]s, the [[Boolean satisfiability problem|satisfiability problem]], [[data mining]], and computer [[program optimization]].