Sciweavers

151 search results - page 6 / 31
» Edge Anonymity in Social Network Graphs
Sort
View
TVCG
2012
196views Hardware» more  TVCG 2012»
13 years 8 months ago
Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
—Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational datasets (e.g., transportation networks, ...
Sheng-Jie Luo, Chun-Liang Liu, Bing-Yu Chen, Kwan-...
SIGMOD
2010
ACM
274views Database» more  SIGMOD 2010»
15 years 10 months ago
K-isomorphism: privacy preserving network publication against structural attacks
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
James Cheng, Ada Wai-Chee Fu, Jia Liu
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
15 years 11 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
CSE
2009
IEEE
15 years 10 months ago
Scaling Behaviors in the Communication Network between Cities
—We analyze the anonymous communication patterns of 2.5 million customers of a Belgian mobile phone operator. With these communications, we construct a social network of customer...
Gautier Krings, Francesco Calabrese, Carlo Ratti, ...
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
15 years 11 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier