We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with, respectively, nA and nB vertices. We define an nB
This paper presents a system for graph clustering where users can visualize the clustering and give "hints" that help a computing method to find better solutions. Hints ...
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Video game players often learn to map their physical actions (e.g., pressing buttons) onto their on-screen avatars' actions (e.g., wielding swords) in order to play. We explo...