Просмотр кода страницы Transitive reduction of a digraph

'''Transitive reduction of a digraph''' --- транзитивная редукция
орграфа. 

A ''' transitive reduction''' <math>TR</math> of a digraph <math>G = (V,A)</math> is a digraph <math>G^{-} =
(V,A^{-})</math> having the minimum number of arcs and the same ''
transitive closure'' of <math>G</math>. It is known that, for any '' dag'' <math>G</math>,
the ''' transitive reduction''' <math>G^{-}</math> is unique
and  is a subgraph (partial graph) of <math>G</math>.