更改

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''.

超图''H'' = (''X'', ''E'')的横截集（或命中集）是一个<math>T\subseteq X</math>集合，该集合与每条边都有非空的交集。如果''T''的真子集不是横截集，则称''T''为极小截集。''H'' 的横截超图是超图（''X''， ''F''），其边集''F''包含''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>，其边集''F''包含''H''的所有最小横截集。

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]].

计算横截面超图在[[组合优化 Combinatorial Optimization]]、[[博弈论 Game Theory]]和[[计算机科学 Computer Science]]的一些领域（例如[[机器学习 Machine Learning]]、[[数据库索引 Indexing of Databases]]、[[可满足性问题the Satisfiability Problem]]、[[数据挖掘Data Mining]]和[[计算机程序优化 Program Optimization]]）都有应用。

计算横截面超图在组合优化 Combinatorial Optimization、[[博弈论 Game Theory]]和计算机科学 Computer Science的一些领域（例如机器学习 Machine Learning、数据库索引 Indexing of Databases、可满足性问题the Satisfiability Problem、数据挖掘Data Mining和计算机程序优化 Program Optimization）都有应用。

==Incidence matrix==

==Incidence matrix==