Real-world tournaments are almost always intransitive. Recent works have noted that parametric models which assume dimensional node representations can effectively model intransitive tournaments. However, nothing is …
We consider the classical problem of finding the minimum feedback arc set on tournaments (MFAST). The problem is NP-hard in general and we study it for important classes of tournaments that arise naturally in the problem …
I am currently pursuing PhD at Department of Computer Science and Engineering under the guidance of Harish G. Ramaswamy. My topic of research is theoretical deep learning.
