On a condition for obtaining an explicit
โ
Anazawa, Tsutomu
๐
Article
๐
1999
๐
John Wiley and Sons
๐
English
โ 70 KB
๐ 1 views
The optimum requirement spanning tree (ORST) studied by Hu is known to be obtained by the Gomory-Hu algorithm when the degrees of vertices are not restricted. We consider a problem to find an ORST with maximum-degree constraints and suggest a particular spanning tree T\* as a candidate for the solut