1 citations · 3 across the 19 of their papers we have counts for
1 paper · 1 filter
Arnab Maiti, Palash Dey
A directed graph where there is exactly one edge between every pair of vertices is called a {\em tournament}. Finding the "best" set of vertices of a tournament is a well studied p…