A ranking method assigns to every directed graph a (weak) ordering of the nodes. In this paper, we axiomatize the ranking method that ranks the nodes according to their outdegree. This method generalizes the ranking by Copeland score for tournaments as characterized in Rubinstein (SIAM J. Appl. Math. 38 (1980) 108-111). © 2003 Elsevier B.V. All rights reserved
In this paper we bring a novel approach to the theory of tournament rankings. We combine two differe...
This paper examines the problem of rank ordering a set of players or objects on the basis of a set o...
We deal with the ranking problem of the nodes in a directed graph. The bilateral relationships speci...
AbstractA ranking method assigns to every directed graph a (weak) ordering of the nodes. In this pap...
A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this pa...
One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland s...
URL des Documents de travail : https://centredeconomiesorbonne.univ-paris1.fr/documents-de-travail-d...
For a graph G = ( V, E), a mapping C: V → 1,2, � k is a node ranking labeling if every path betwee...
A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such...
A tournament T<SUB>n</SUB> is an orientation of the complete graph on nvertices. We continue the alg...
A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is ...
This paper is devoted to the study of techniques allowing one to rank order the elements of a finite...
The first part of the thesis concerns the problem of ranking in general. We take a closer look at th...
Given a set of alternatives to be ranked, and some pairwise comparison data, ranking is a least squa...
AbstractIn this paper, neighborhood monotonicity is presented as a natural property for methods of r...
In this paper we bring a novel approach to the theory of tournament rankings. We combine two differe...
This paper examines the problem of rank ordering a set of players or objects on the basis of a set o...
We deal with the ranking problem of the nodes in a directed graph. The bilateral relationships speci...
AbstractA ranking method assigns to every directed graph a (weak) ordering of the nodes. In this pap...
A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this pa...
One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland s...
URL des Documents de travail : https://centredeconomiesorbonne.univ-paris1.fr/documents-de-travail-d...
For a graph G = ( V, E), a mapping C: V → 1,2, � k is a node ranking labeling if every path betwee...
A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such...
A tournament T<SUB>n</SUB> is an orientation of the complete graph on nvertices. We continue the alg...
A tournament is an orientation of a complete simple graph. The score of a vertex in a tournament is ...
This paper is devoted to the study of techniques allowing one to rank order the elements of a finite...
The first part of the thesis concerns the problem of ranking in general. We take a closer look at th...
Given a set of alternatives to be ranked, and some pairwise comparison data, ranking is a least squa...
AbstractIn this paper, neighborhood monotonicity is presented as a natural property for methods of r...
In this paper we bring a novel approach to the theory of tournament rankings. We combine two differe...
This paper examines the problem of rank ordering a set of players or objects on the basis of a set o...
We deal with the ranking problem of the nodes in a directed graph. The bilateral relationships speci...
DOI
Add to ORKG