Jingrui He, Hanghang Tong, et al.
Frontiers of Computer Science in China
Given a graph, how to find a small group of 'gateways', that is a small subset of nodes that are crucial in connecting the source to the target? For instance, given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to help you learn about, say, wavelets? We formally formulate this problem in two scenarios: Pair-Gateway and Group-Gateway. For each scenario, we show that it is sub-modular and thus it can be solved near-optimally. We further give fast, scalable algorithms to find such gateways. Extensive experimental evaluations on real data sets demonstrate the effectiveness and efficiency of the proposed methods. © 2012 Springer Science+Business Media, LLC.
Jingrui He, Hanghang Tong, et al.
Frontiers of Computer Science in China
Hanghang Tong, Spiros Papadimitriou, et al.
KDD 2008
Christos Faloutsos, Kevin S. McCurley, et al.
KDD 2004
Liangyue Li, Hanghang Tong, et al.
IEEE TKDE