| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428297 | Information Processing Letters | 2007 | 4 Pages |
Abstract
The Feedback Arc Set problem asks whether it is possible to delete at most k arcs to make a directed graph acyclic. We show that Feedback Arc Set is NP-complete for bipartite tournaments, that is, directed graphs that are orientations of complete bipartite graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
