Effective estimation of node-to-node correspondence between different graphs
In this work, we propose a novel method for accurately estimating the node-to-node
correspondence between two graphs. Given two graphs and their pairwise node similarity …
correspondence between two graphs. Given two graphs and their pairwise node similarity …
Threatening Privacy across Social Graphs: A Structural Features Approach
Can privacy of individuals in an anonymized social graph be threatened by a handful of
structural features ie, Without knowledge of link-level connectivity? The answer is yes. We …
structural features ie, Without knowledge of link-level connectivity? The answer is yes. We …