Easy and hard instances of arc ranking in directed graphs (Q2462400): Difference between revisions

@@ Property / cites work @@
+Rankings of Graphs
@@ Property / cites work: Rankings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge ranking of weighted trees
@@ Property / cites work: Edge ranking of weighted trees / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal node ranking of trees
@@ Property / cites work: Optimal node ranking of trees / rank @@
+Normal rank
@@ Property / cites work @@
+On an edge ranking problem of trees and graphs
@@ Property / cites work: On an edge ranking problem of trees and graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Ordered colourings
@@ Property / cites work: Ordered colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Rankings of Directed Graphs
@@ Property / cites work: Rankings of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge ranking of graphs is hard
@@ Property / cites work: Edge ranking of graphs is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250211
@@ Property / cites work: Q4250211 / rank @@
+Normal rank