Ranking by Outdegree for Directed Graphs

J.R. van den Brink; R.P. Gilles

doi:10.1016/S0012-365X(03)00050-5

Ranking by Outdegree for Directed Graphs

Research output: Contribution to Journal › Article › Academic

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). © 2003 Elsevier B.V. All rights reserved.

Original language	English
Pages (from-to)	261-270
Number of pages	9
Journal	Discrete Mathematics
Volume	271
DOIs	https://doi.org/10.1016/S0012-365X(03)00050-5
Publication status	Published - 2003

Access to Document

10.1016/S0012-365X(03)00050-5

Persistent URL (handle)

Copy link address

Cite this

@article{f7402e48b01945d9828efee4c4350dce,

title = "Ranking by Outdegree for Directed Graphs",

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). {\textcopyright} 2003 Elsevier B.V. All rights reserved.",

author = "{van den Brink}, J.R. and R.P. Gilles",

year = "2003",

doi = "10.1016/S0012-365X(03)00050-5",

language = "English",

volume = "271",

pages = "261--270",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

}

TY - JOUR

T1 - Ranking by Outdegree for Directed Graphs

AU - van den Brink, J.R.

AU - Gilles, R.P.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

U2 - 10.1016/S0012-365X(03)00050-5

DO - 10.1016/S0012-365X(03)00050-5

M3 - Article

SN - 0012-365X

VL - 271

SP - 261

EP - 270

JO - Discrete Mathematics

JF - Discrete Mathematics

ER -

Ranking by Outdegree for Directed Graphs

Abstract

Access to Document

Persistent URL (handle)

Fingerprint

Cite this