Abstract
An algorithm is presented for finding annth-best spanning tree of an edge-weighted graphG. In sharp contrast to related ranking algorithms, the number of steps is a linear function of the parametern. The results apply as well to ranking the bases of an abstract matroid.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bellman, R. andKalaba, R.,On k-th best policies. J. Soc. Indust. Appl. Math.8 (1960), 582–588.
Edmonds, J.,Matroid partition. InMathematics of the Decision Sciences Part 1, Lectures in Applied Mathematics Vol. 11. Amer. Math. Soc., Providence, R. I., 1968, pp. 335–345.
Edmonds, J.,Matroids and the Greedy algorithm. Math. Programming1 (1971), 127–135.
Harary, F.,Graph theory. Addison-Wesley, Reading, Massachusetts, 1969.
Holzmann, C. andHarary F.,On the tree graph of a matroid. SIAM J. Appl. Math.22 (1972), 187–193.
Kruskal, J.,On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc.7 (1956), 48–50.
Pollack, M.,Solutions of the kth best route through a network — a review. J. Math. Anal. Appl.3 (1961), 547–559.
Shank, H. S.,Note on Hamilton circuits in tree graphs. IEEE Trans. C. T.15 (1968), 86.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Burns, R.N., Haff, C.E. A combinatorial ranking problem. Aeq. Math. 14, 351–355 (1976). https://doi.org/10.1007/BF01835983
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01835983