Sciweavers

151 search results - page 5 / 31
» Edge Anonymity in Social Network Graphs
Sort
View
COMSWARE
2008
IEEE
13 years 10 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...
PODC
2010
ACM
14 years 21 days ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
PET
2007
Springer
14 years 2 months ago
Anonymity in the Wild: Mixes on Unstructured Networks
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...
Shishir Nagaraja
ICDE
2010
IEEE
209views Database» more  ICDE 2010»
14 years 2 months ago
Overlapping Community Search for social networks
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
Arnau Padrol-Sureda, Guillem Perarnau-Llobet, Juli...
WPES
2006
ACM
14 years 2 months ago
Private social network analysis: how to assemble pieces of a graph privately
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
Keith B. Frikken, Philippe Golle