Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher

First Page		Document Content
Date: 2014-09-26 08:28:47 NP-complete problems Graph coloring Networks Connectivity Dominating set Edge coloring Network theory Copying mechanism Breadth-first search Graph theory Theoretical computer science Mathematics		Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Download Document from Source Website File Size: 324,05 KB Share Document on Facebook

	epl draft Scale-free networks as an epiphenomenon of memory F. Caravelli1 , A. Hamma2 and M. Di Ventra3 arXiv:1312.2289v5 [physics.soc-ph] 15 Feb 2015 DocID: 1qpll - View Document
	Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset DocID: 1pWbB - View Document
	Sustainable growth in complex networks Claudio J. Tessone, Markus M. Geipel, F. Schweitzer arXiv:1007.1330v1 [physics.soc-ph] 8 JulChair of Systems Design, D-MTEC, ETH Zurich, CH-8032 Zurich, Switzerland DocID: 1oSKP - View Document
	/Users/Montse/Desktop/Montse/Twitter_all/twitterToTest/results/Plots/ForPaper/modelsPlots/TopsyUrls__Errors_width.eps DocID: 1m7FQ - View Document
	Unfolding Dynamics in a Social Network: Co-evolution of Link Formation and User Interaction Zhi Yang§ , Jilong Xue§ , Xiaohan Zhao† , Xiao Wang§ ‡ , Ben Y. Zhao† , and Yafei Dai§ § Computer Science Department DocID: 1lQSe - View Document