Banks winners in tournaments are difficult to recognize

Woeginger, Gerhard J. (2003) Banks winners in tournaments are difficult to recognize. Social Choice and Welfare, 20 (3). pp. 523-528. ISSN 0176-1714

PDF
Restricted to UT campus only: Request a copy
146Kb

Abstract:	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.
Item Type:	Article
Copyright:	© Springer 2003
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/58670
Official URL:	http://dx.doi.org/10.1007/s003550200197
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 213302