Resisting Structural Re-identification in Anonymized Social Networks Michael Hay, Gerome Miklau, David Jensen, Don Towsley, Philipp Weis Department of Computer Science University of Massachusetts Amherst {mhay,miklau,jen

First Page		Document Content
Date: 2008-10-22 09:22:53 Graph Degree distribution Centrality Bipartite graph Scale-free network Shortest path problem Breadth-first search Connectivity Topology Graph theory Mathematics Network theory		Resisting Structural Re-identification in Anonymized Social Networks Michael Hay, Gerome Miklau, David Jensen, Don Towsley, Philipp Weis Department of Computer Science University of Massachusetts Amherst {mhay,miklau,jen Add to Reading List Source URL: www.vldb.org Download Document from Source Website File Size: 1,38 MB Share Document on Facebook

	Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook DocID: 1xVkB - View Document
	PDF Document DocID: 1xkJU - View Document
	Graph theory Po-Shen Loh June DocID: 1vmTo - View Document
	Graph theory Po-Shen Loh June DocID: 1vhpu - View Document
	Graph theory Po-Shen Loh June DocID: 1v8nl - View Document