Banks winners in tournaments are difficult to recognize

摘要

Given a tournament T, a Banks winner of T is the top vertex of any maximal (with respect to inclusion) transitive subtournament of T. In this technical note, we show that the problem of deciding whether some fixed vertex v is a Banks winner for T is NP-complete. Received: 22 February 2002/Accepted: 20 June 2002