A note on ``Bank winners in tournaments are difficult to recognize'' by G. J. Woeginger (Q1767293)

Given a tournament \(T\), a Banks winner of \(T\) is the first vertex of any maximal (with respect to inclusion) transitive subtournament of \(T\). While \textit{G. J. Woeginger} [ibid. 20, 523--528 (2003; Zbl 1073.05538)] shows that recognizing whether a given vertex of \(T\) is a Banks winner is NP-complete, the computation of a Banks winner of \(T\) is polynomial, and more precisely linear with respect to the size of \(T\).