796 search results - page 44 / 160 » The Anonymous Subgraph Problem |
GC
2010
Springer
14 years 11 months ago
2010
Springer
A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph
106
Voted
JCO
2010
14 years 11 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Protecting data privacy is an important problem in microdata distribution. Anonymization algorithms typically aim to protect individual privacy, with minimal impact on the quality...
124
Voted
SP
2008
IEEE
15 years 7 months ago
2008
IEEE
— Applications such as VoIP need to provide anonymity to clients while maintaining low latency to satisfy quality of service (QoS) requirements. Existing solutions for providing ...
130
Voted
FC
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Anonymity features of electronic payment systems are important for protecting privacy in an electronic world. However, complete anonymity prevents monitoring financial t...