Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
Recommender systems, notably collaborative and hybrid information filtering approaches, vitally depend on neighborhood formation, i.e., selecting small subsets of most relevant pee...
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Coalition formation in social networks, consisting of a graph of interdependent agents, allows many choices of which task to select and with whom to partner in the social network....