Algorithms for finding maximum transitive subtournaments (Q5963652)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for finding maximum transitive subtournaments |
scientific article; zbMATH DE number 6544340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for finding maximum transitive subtournaments |
scientific article; zbMATH DE number 6544340 |
Statements
Algorithms for finding maximum transitive subtournaments (English)
0 references
23 February 2016
0 references
backtrack search
0 references
clique
0 references
directed acyclic graph
0 references
feedback vertex set
0 references
Russian doll search
0 references
transitive tournament
0 references
0 references
0.7776135206222534
0 references
0.7597743272781372
0 references
0.7583601474761963
0 references
0.7462292313575745
0 references
0.7325666546821594
0 references
