796 search results - page 14 / 160 » The Anonymous Subgraph Problem |
PAKDD
2009
ACM
14 years 4 months ago
2009
ACM
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
PAKDD
2009
ACM
14 years 2 months ago
2009
ACM
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
PCI
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
WG
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
OPODIS
2007
13 years 8 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...