1 paper
Amir Abboud, Tomer Grossman, Moni Naor +1
A tournament is an orientation of a complete graph. A vertex that can reach every other vertex within two steps is called a \emph{king}. We study the complexity of finding k king…