G. Gutin and A. Yeo, Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph, to appear in Discrete Applied Mathematics. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Extension of Zermelo's Model for Ranking by Paired Comparisons - Conner, Grant (1999) (Correct)
....as # # 0. Remark One ranking method that has been proposed is to order the objects so as to minimize the number of upsets in the tournament. That is, an order # is chosen so as to minimize P i#j a ij . Related methods, which take into account the magnitude of each upset, are discussed in [14], 18] 19] Although the extension of Zermelo s model analyzed in this paper does not necessarily do this, the preceding result signifies that it does avoid a certain class of upsets. Recall that two objects, i and j, will be in the same strongly connected component of #(A) if and only if i D j ....
Gutin, G. and Yeo, A. (1996) Ranking the vertices of a complete multipartite paired comparison digraph. Discrete Appl. Math. 69 75--82.
Cycles in Semicomplete Multipartite Digraphs - Yeo (1996) Self-citation (Yeo) (Correct)
....to Journal of Graph Theory. ffl A Polynomial Algorithm for the Hamiltonian Cycle problem in Semicomplete Multipartite Digraphs , by J. Bang Jensen, G. Gutin and A. Yeo, Preprint no. 2, 1996, at Odense University, submitted to Journal of Graph Theory. We will often refer to the above papers ([8, 35, 56, 9, 36, 10] in the bibliography) which furthermore will be included together with this report, for evaluation. The proofs of the results in the above papers will often be omitted in this report, as this report isn t to exceed 30 pages. However the reader is refered to the relavant paper for a proof of the ....
....conjecture is true for every extended semicomplete digraph (see [6] and, in general, if k = 2 (see [15] 4. 3 Ranking the vertices of a Complete Multipartite Paired Comparison Digraph I will in this section very briefly describe the results I, together with Gregory Gutin, obtained in the paper [35]. I will first give an introduction and some terminology, before stating our results. The reader is referred to our preprint Ranking the vertices of a Complete Multipartite Paired Comparison Digraph (see [35] for the proofs of our theorems. Let D = V; A) be a weighted digraph in which every ....
[Article contains additional citation context not shown here]
G. Gutin and A. Yeo, Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph, to appear in Discrete Applied Mathematics.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC