10 citations · 17 across the 3 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
cs.DB2012★ 10 cited
Truss Decomposition in Massive Networks
Jia Wang, James Cheng
The k-truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomia…
cs.DB2012★ 7 cited
Small Count Privacy and Large Count Utility in Data Publishing
Ada Wai-Chee Fu, Jia Wang, Ke Wang +1
While the introduction of differential privacy has been a major breakthrough in the study of privacy preserving data publication, some recent work has pointed out a number of cases…