Showing papers on "Ranking SVM published in 1976"
TL;DR: In this article, an algorithm for finding the annth best spanning tree of an edge-weighted graph is presented, where the number of steps is a linear function of the parametern.
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.
4 citations