On Steiner centers of graphs
碩士 === 國立中央大學 === 數學研究所 === 93 === Abstract Oellermann and Tian presented an algorithm for finding the n-center of a tree in 1990 [3], but the correction of the algorithm seems not sound. In this paper we give a clear proof of the validity of their algorithm. They also showed a containment relation...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/47779984708880756568 |