Add to ORKGMany problems can be modeled as the search for a subgraph S- A with specifi�c properties, given a graph G = (V;A). There are applications in which it is desirable to ensure also S to be anonymous. In this work we formalize an anonymity property for a generic family of subgraphs and the corresponding decision problem. We devise an algorithm to solve a particular case of the problem and we show that, under certain conditions, its computational complexity is polynomial. We also examine in details several specifi�c family of subgraphs
In this article we provide a formal framework for reidentification in general. We define n-confusion...
Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of...
Complex networks gathered from our online interactions provide a rich source of information that can...
Many problems can be modeled as the search for a subgraph S- A with specifi�c properties, given a g...
In this work we address the Anonymous Subgraph Problem (ASP). The problem asks to decide whether a d...
A graph is said to be k-anonymous for an integer k, if for every vertex in the graph there are at le...
We define and analyze an anonymization problem in undirected graphs, which is motivated by certain p...
Social networks had an ever increasing relevance for data mining, yet preserving the anonymity of us...
Consider a digraph where the vertices represent people and an arc (i, j) represents the possibility...
in Springer series Lecture Notes in Computer Science, vol. 8894International audienceThe Degree Anon...
As the booming of social networks, network analysis has benefited greatly from released network data...
The proliferation of online social networks, and the concomitant accumulation of user data, give ris...
Providing anonymity support for peer-to-peer (P2P) overlay networks is critical. Otherwise, potentia...
In this article we provide a formal framework for reidentification in general. We define n-confusion...
Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of...
Complex networks gathered from our online interactions provide a rich source of information that can...
Many problems can be modeled as the search for a subgraph S- A with specifi�c properties, given a g...
In this work we address the Anonymous Subgraph Problem (ASP). The problem asks to decide whether a d...
A graph is said to be k-anonymous for an integer k, if for every vertex in the graph there are at le...
We define and analyze an anonymization problem in undirected graphs, which is motivated by certain p...
Social networks had an ever increasing relevance for data mining, yet preserving the anonymity of us...
Consider a digraph where the vertices represent people and an arc (i, j) represents the possibility...
in Springer series Lecture Notes in Computer Science, vol. 8894International audienceThe Degree Anon...
As the booming of social networks, network analysis has benefited greatly from released network data...
The proliferation of online social networks, and the concomitant accumulation of user data, give ris...
Providing anonymity support for peer-to-peer (P2P) overlay networks is critical. Otherwise, potentia...
In this article we provide a formal framework for reidentification in general. We define n-confusion...
Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of...
Complex networks gathered from our online interactions provide a rich source of information that can...