Brink, René van den; Rusinowska, Agnieszka - 2019
One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a … ingoing arcs). In the ranking by Copeland score, a node is ranked higher, the higher is its Copeland score. In this paper, we … deal with an alternative to rank nodes according to their out- and indegree, namely ranking the nodes according to their …