Showing 1 - 2 of 2
A ranking method assigns to every weighted directed graph a (weak) orderingof the nodes. In this paper we axiomatize the ranking method that ranksthe nodes according to their outflow using four independent axioms. This outflowranking method generalizes the ranking by outdegree for directed...
Persistent link: https://www.econbiz.de/10011255526
A ranking method assigns to every weighted directed graph a (weak) ordering
Persistent link: https://www.econbiz.de/10005144488