Sciweavers

796 search results - page 1 / 160
» The Anonymous Subgraph Problem
Sort
View
COLOGNETWENTE
2009
14 years 10 months ago
The Anonymous Subgraph Problem
Andrea Bettinelli, Leo Liberti, Franco Raimondi, D...
SIGMOD
2010
ACM
274views Database» more  SIGMOD 2010»
15 years 2 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
ICDM
2006
IEEE
184views Data Mining» more  ICDM 2006»
15 years 3 months ago
MARGIN: Maximal Frequent Subgraph Mining
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
Lini T. Thomas, Satyanarayana R. Valluri, Kamalaka...
FOCS
2007
IEEE
15 years 3 months ago
On the Advantage over Random for Maximum Acyclic Subgraph
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
Moses Charikar, Konstantin Makarychev, Yury Makary...