The outflow ranking method for weighted directed graphs
From MaRDI portal
Publication:958091
DOI10.1016/J.EJOR.2007.11.051zbMATH Open1170.05312OpenAlexW2126076627MaRDI QIDQ958091FDOQ958091
Authors: René van den Brink, Robert P. Gilles 
Publication date: 2 December 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://papers.tinbergen.nl/06044.pdf
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Copeland choice function. An axiomatic characterization
- Ranking the Participants in a Tournament
- Title not available (Why is that?)
- 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
- Ranking by outdegree for directed graphs
Cited In (15)
- 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
- The degree ratio ranking method for directed graphs
- Ranking by outdegree for directed graphs
- On different ranking methods
- On the monotonicity of the eigenvector method
- Weighted graph vertices ranking using absolute potentials of electric circuit nodes
- Ranking by relational power based on digraphs
- Ranking the vertices of complete multipartite paired-comparison digraphs
- The degree measure as utility function over positions in graphs and digraphs
- Mutual rankings
- The positional power of nodes in digraphs
- The flow network method
- Erratum to: ``Ranking by outdegree for directed graphs
- Some impossibilities of ranking in generalized tournaments
This page was built for publication: The outflow ranking method for weighted directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958091)
