Algorithms for finding maximum transitive subtournaments.
Lasse KiviluotoPatric R. J. ÖstergårdVesa P. VaskelainenPublished in: J. Comb. Optim. (2016)
Keyphrases
- computational complexity
- times faster
- computational cost
- optimization problems
- computationally efficient
- data structure
- orders of magnitude
- maximum clique
- real time
- computer vision algorithms
- computationally expensive
- computational efficiency
- benchmark datasets
- machine learning algorithms
- theoretical analysis
- lower bound
- objective function
- case study
- computer vision
- learning algorithm
- real world