AbstractA 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)
AbstractIn this paper we deal with the arc ranking problem of directed graphs. We give some classes ...
AbstractA paired comparison digraph D is a weighted digraph in which the sum of the weights of arcs,...
In this paper we tackle the problem of ranking the vertices in an undirected graph given some prefer...
A ranking method assigns to every directed graph a (weak) ordering of the nodes. In this paper, we a...
One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland s...
A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this pa...
URL des Documents de travail : https://centredeconomiesorbonne.univ-paris1.fr/documents-de-travail-d...
In this paper we examine the ranking for the case of many judges and manyobjects. We use a directed ...
In this paper we examine the ranking of objects whose relative merits are given by a directed graph....
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...
We present in this paper a sparse HPC implementation for outranking digraphs of huge orders, up to s...
This paper is devoted to the study of techniques allowing one to rank order the elements of a finite...
For a graph G = ( V, E), a mapping C: V → 1,2, � k is a node ranking labeling if every path betwee...
A set ranking method assigns to each tournament on a given set an ordering of the subsets of that se...
AbstractIn this paper we deal with the arc ranking problem of directed graphs. We give some classes ...
AbstractA paired comparison digraph D is a weighted digraph in which the sum of the weights of arcs,...
In this paper we tackle the problem of ranking the vertices in an undirected graph given some prefer...
A ranking method assigns to every directed graph a (weak) ordering of the nodes. In this paper, we a...
One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland s...
A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this pa...
URL des Documents de travail : https://centredeconomiesorbonne.univ-paris1.fr/documents-de-travail-d...
In this paper we examine the ranking for the case of many judges and manyobjects. We use a directed ...
In this paper we examine the ranking of objects whose relative merits are given by a directed graph....
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...
We present in this paper a sparse HPC implementation for outranking digraphs of huge orders, up to s...
This paper is devoted to the study of techniques allowing one to rank order the elements of a finite...
For a graph G = ( V, E), a mapping C: V → 1,2, � k is a node ranking labeling if every path betwee...
A set ranking method assigns to each tournament on a given set an ordering of the subsets of that se...
AbstractIn this paper we deal with the arc ranking problem of directed graphs. We give some classes ...
AbstractA paired comparison digraph D is a weighted digraph in which the sum of the weights of arcs,...
In this paper we tackle the problem of ranking the vertices in an undirected graph given some prefer...
DOI
Add to ORKG