Name
Abstract | ||
|---|---|---|
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). |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0012-365X(03)00050-5 | Discrete Mathematics |
Keywords | Field | DocType |
outdegree,91b08,copeland score,05c20,ranking method,directed graphs,axiomatic,graph theory,directed graph,ranking | Graph theory,Discrete mathematics,Combinatorics,Ranking,Axiom,Directed graph,Mathematics | Journal |
Volume | Issue | ISSN |
271 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.79 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| René Van Den Brink | 1 | 187 | 27.06 |
| Robert P. Gilles | 2 | 144 | 23.11 |
| vu | 3 | 856 | 122.39 |
| faculteit der economische wetenschappen en bedrijfskunde | 4 | 97 | 12.85 |