Pages that link to "Item:Q958091"
From MaRDI portal
The following pages link to The outflow ranking method for weighted directed graphs (Q958091):
Displaying 15 items.
- Ranking the vertices of complete multipartite paired-comparison digraphs (Q749548) (← links)
- Ranking methods based on valued preference relations. A characterization of the net flow method (Q1198298) (← links)
- Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows (Q1200329) (← links)
- Ranking by outdegree for directed graphs (Q1408881) (← links)
- Mutual rankings (Q1680095) (← links)
- Ranking the vertices of a complete multipartite paired comparison digraph (Q1923602) (← links)
- The degree ratio ranking method for directed graphs (Q2028895) (← links)
- On the monotonicity of the eigenvector method (Q2030562) (← links)
- The flow network method (Q2417378) (← links)
- Erratum to: ``Ranking by outdegree for directed graphs'' (Q2421884) (← links)
- The positional power of nodes in digraphs (Q2575412) (← links)
- The degree measure as utility function over positions in graphs and digraphs (Q2670539) (← links)
- RANKING BY RELATIONAL POWER BASED ON DIGRAPHS (Q3647388) (← links)
- On Different Ranking Methods (Q5022152) (← links)
- Some Impossibilities of Ranking in Generalized Tournaments (Q5384712) (← links)