Pages that link to "Item:Q1408881"
From MaRDI portal
The following pages link to Ranking by outdegree for directed graphs (Q1408881):
Displaying 18 items.
- The outflow ranking method for weighted directed graphs (Q958091) (← links)
- A characterization of the Copeland solution (Q985210) (← links)
- Edge ranking of graphs is hard (Q1392547) (← links)
- Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
- Evolvement of influence in hierarchies (Q1925954) (← links)
- The degree ratio ranking method for directed graphs (Q2028895) (← links)
- Axiomatizations of the \(\beta\) and the score measures in networks (Q2041074) (← links)
- On the exponential ranking and its linear counterpart (Q2086597) (← links)
- A graph interpretation of the least squares ranking method (Q2340263) (← links)
- Erratum to: ``Ranking by outdegree for directed graphs'' (Q2421884) (← links)
- PageRank regular digraphs with prime out-degrees (Q2443420) (← links)
- Scoring of web pages and tournaments-axiomatizations (Q2500743) (← 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)
- Centrality measures in networks (Q6051894) (← links)
- Game theoretic foundations of the gately power measure for directed networks (Q6555652) (← links)