The following pages link to (Q4232782):
Displaying 7 items.
- On graphs associated to sets of rankings (Q491081) (← links)
- Edge ranking of graphs is hard (Q1392547) (← links)
- Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
- The degree ratio ranking method for directed graphs (Q2028895) (← links)
- Ordinal network representation: Representing proximities by graphs (Q2277198) (← links)
- Easy and hard instances of arc ranking in directed graphs (Q2462400) (← links)
- Ranking measures for radially Moore graphs (Q3064042) (← links)