A note on ``Bank winners in tournaments are difficult to recognize'' by G. J. Woeginger (Q1767293): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00355-003-0241-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070033045 / rank | |||
Normal rank | |||
Latest revision as of 19:10, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on ``Bank winners in tournaments are difficult to recognize'' by G. J. Woeginger |
scientific article |
Statements
A note on ``Bank winners in tournaments are difficult to recognize'' by G. J. Woeginger (English)
0 references
8 March 2005
0 references
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\).
0 references
NP-complete
0 references
