The degree ratio ranking method for directed graphs

DOI10.1016/J.EJOR.2020.06.013zbMATH Open1487.91039OpenAlexW3039525325MaRDI QIDQ2028895FDOQ2028895

Agnieszka Rusinowska, René van den Brink

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.06.013

Recommendations

• Ranking by outdegree for directed graphs
• Rankings of Directed Graphs
• scientific article; zbMATH DE number 1262792
• Beyond rankings: comparing directed acyclic graphs
• The outflow ranking method for weighted directed graphs
• Higher-order rank functions on directed graphs
• Ranking measures for radially Moore graphs
• On the rank of weighted graphs
• On an edge ranking problem of trees and graphs
• Ranking and sparsifying a connection graph

zbMATH Keywords

directed graphgroup decisions and negotiationsranking methodCopeland scoredegree ratio

Mathematics Subject Classification ID

Decision theory (91B06) Social choice (91B14) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Title not available (Why is that?)
• The Copeland choice function. An axiomatic characterization
• Scoring of web pages and tournaments-axiomatizations
• Ranking the Participants in a Tournament
• The Measurement of Intellectual Influence
• An axiomatic characterization of the Hirsch-index
• On the influence of a ranking system
• Impartial division of a dollar
• Collective attention and ranking methods
• A ranking method based on handicaps
• Ranking methods based on valued preference relations. A characterization of the net flow method
• Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows
• Competitive economy as a ranking device over networks
• Ranking by outdegree for directed graphs
• The outflow ranking method for weighted directed graphs
• Axiomatic foundations for ranking systems
• Mutual rankings

Cited In (8)

• Ranking by outdegree for directed graphs
• Easy and hard instances of arc ranking in directed graphs
• The degree measure as utility function over positions in graphs and digraphs
• Title not available (Why is that?)
• The positional power of nodes in digraphs
• Ranking measures for radially Moore graphs
• On Different Ranking Methods
• Beyond rankings: comparing directed acyclic graphs

This page was built for publication: The degree ratio ranking method for directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028895)