Feedback arc set in bipartite tournaments is NP-complete (Q845963): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2006.11.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2141319521
@@ Property / OpenAlex ID: W2141319521 / rank @@
+Normal rank
@@ Property / cites work @@
+Aggregating inconsistent information
@@ Property / cites work: Aggregating inconsistent information / rank @@
+Normal rank
@@ Property / cites work @@
+Ranking Tournaments
@@ Property / cites work: Ranking Tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Structure preserving reductions among convex optimization problems
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
+Normal rank
@@ Property / cites work @@
+A Min-Max Theorem on Feedback Vertex Sets
@@ Property / cites work: A Min-Max Theorem on Feedback Vertex Sets / rank @@
+Normal rank
@@ Property / cites work @@
+The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
+Normal rank
@@ Property / cites work @@
+Q4694754
@@ Property / cites work: Q4694754 / rank @@
+Normal rank
@@ Property / cites work @@
+Feedback vertex sets and cyclically reducible graphs
+Normal rank