Showing papers on "Ranking SVM published in 1995"
16 Aug 1995
TL;DR: This paper shows that there is a linear time ranking algorithm associated with that Hamilton path that returns the rank-position of each node of the graph with respect to the order given by the Hamilton path.
Abstract: In previous work, Feldmann and Mysliwietz [3] showed that every shuffle-exchange graph contains a Hamilton path. In this paper, we show that there is a linear time ranking algorithm associated with that Hamilton path. The ranking algorithm returns the rank-position of each node of the graph with respect to the order given by the Hamilton path. Ranking algorithms are important for they can be applied to yield efficient implementations of certain network emulations using SIMD-style parallel algorithms for translating node labels.