Algorithms for finding maximum transitive subtournaments (Q5963652): Difference between revisions
From MaRDI portal
Latest revision as of 11:02, 11 July 2024
scientific article; zbMATH DE number 6544340
Language | Label | Description | Also known as |
---|---|---|---|
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