【摘要】 本文根据[1,2,3]所建立的理论,首先讨论了复形K~n的r维支撑树的性质,然后给出求在一个单形D~s上具有次限制的r维最小树的一个算法。更多还原

【Abstract】 In 1974, Glover and Klingman gave an algorithm to find minimum spanning trees with a fixed number of links at a node in a connected network. Their results are generalized to r-dimensional complexes in the present paper. Making use of iterations on the cycle bases, the algorithm as well as the proofs of the theorems for the general case are slightly simpler than those for the special case given by Glover and Klingman.更多还原