Pages that link to "Item:Q896093"
From MaRDI portal
The following pages link to Maximizing the number of edges in optimal \(k\)-rankings (Q896093):
Displaying 4 items.
- Edge ranking of graphs is hard (Q1392547) (← links)
- \(l_p\)-optimal rankings and max-optimal rankings are different (Q1696534) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- Optimal edge ranking of complete bipartite graphs in polynomial time (Q5492694) (← links)