Efficient Dynamic Algorithms for Feedback Problems in Tournaments

This paper presents the first dynamic algorithms for the Feedback Arc Set problem and the Feedback Vertex Set problem in tournaments. The algorithms maintain a dynamic tournament under arc reversals and efficiently answer queries about the existence of feedback sets of bounded size.