Key points are not available for this paper at this time.
Homogeneous matroids are characterized by the property that strength equals fractional arboricity, and arise in the study of base modulus 22. For graphic matroids, Cunningham 9 provided efficient algorithms for calculating graph strength, and also for determining minimum cost reinforcement to achieve a desired strength. This paper extends this latter problem by focusing on two optimal strategies for transforming a matroid into a homogeneous one, by either increasing or decreasing element weights. As an application to graphs, we give algorithms to solve this problem in the context of spanning trees.
Truong et al. (Wed,) studied this question.