Просмотр кода страницы Steiner n-center

'''Steiner <math>n</math>-center''' --- <math>n</math>-центр Штейнера. 

The ''' Steiner distance''' of a set <math>S</math> of vertices in a connected
graph <math>G</math> is the minimum number of edges in a connected subgraph
containing <math>S</math>. The ''' Steiner <math>n</math>-eccentricity''' <math>e_{n}(v)</math> is the
maximum Steiner distance among sets of order <math>n</math> containing <math>v</math>. The
''' Steiner <math>n</math>-center''' is the set of vertices with the minimum Steiner
<math>n</math>-eccentricity. It is easy to verify that the Steiner 2-eccentricity
and 2-center correspond to the '' eccentricity'' and '' center'',
respectively.