An optimal algorithm to find champions of tournament graphs (Q6536260)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7834815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm to find champions of tournament graphs |
scientific article; zbMATH DE number 7834815 |
Statements
An optimal algorithm to find champions of tournament graphs (English)
0 references
19 April 2024
0 references
tournament graph
0 references
round-robin tournament
0 references
Copeland winner
0 references
0.7397380471229553
0 references
0.7233808040618896
0 references
0.7166571021080017
0 references
0.7152588963508606
0 references
0.7152340412139893
0 references
