2012
DOI: 10.1007/s10791-012-9190-3
|View full text |Cite
|
Sign up to set email alerts
|

Gateway finder in large graphs: problem definitions and fast solutions

Abstract: 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: PairGateway and Group-Gateway. For each scenario, we show that it is sub-modular and thus… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 33 publications
0
1
0
Order By: Relevance
“…Nevertheless, there has been some work focused on finding certain "types" of nodes in the graph that have a particular predefined role (i.e., structural pattern) [65], [66], [67]. For example, an early work by Kleinberg et al [65] essentially computes the Singular Value Decomposition (SVD) [68] of a graph's adjacency matrix (i.e., eigenvectors of AA T and A T A) 3 , then identifies two types of star-center nodes based on incoming or 3.…”
Section: Row/column Similarity Of Adjacency Matrixmentioning
confidence: 99%
“…Nevertheless, there has been some work focused on finding certain "types" of nodes in the graph that have a particular predefined role (i.e., structural pattern) [65], [66], [67]. For example, an early work by Kleinberg et al [65] essentially computes the Singular Value Decomposition (SVD) [68] of a graph's adjacency matrix (i.e., eigenvectors of AA T and A T A) 3 , then identifies two types of star-center nodes based on incoming or 3.…”
Section: Row/column Similarity Of Adjacency Matrixmentioning
confidence: 99%