The minimum feedback arc set problem and the acyclic disconnection for graphs (Q526233): Difference between revisions

@@ Property / cites work @@
+Ranking Tournaments
@@ Property / cites work: Ranking Tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+On the acyclic disconnection and the girth
@@ Property / cites work: On the acyclic disconnection and the girth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4539516
@@ Property / cites work: Q4539516 / rank @@
+Normal rank
@@ Property / cites work @@
+The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
+Normal rank
@@ Property / cites work @@
+A fast and effective heuristic for the feedback arc set problem
+Normal rank
@@ Property / cites work @@
+On the acyclic disconnection of multipartite tournaments
+Normal rank
@@ Property / cites work @@
+Arc‐Disjoint Cycles and Feedback Arc Sets
@@ Property / cites work: Arc‐Disjoint Cycles and Feedback Arc Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs
+Normal rank
@@ Property / cites work @@
+Circulant tournaments of prime order are tight
@@ Property / cites work: Circulant tournaments of prime order are tight / rank @@
+Normal rank
@@ Property / cites work @@
+Circular colorings of edge-weighted graphs
@@ Property / cites work: Circular colorings of edge-weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The dichromatic number of a digraph
@@ Property / cites work: The dichromatic number of a digraph / rank @@
+Normal rank
@@ Property / cites work @@
+The acyclic disconnection of a digraph
@@ Property / cites work: The acyclic disconnection of a digraph / rank @@
+Normal rank