doi:[removed]j.comnet[removed]

First Page		Document Content
Date: 2011-05-06 06:34:25 Network theory Routing Shortest path problem Average path length Degree distribution Graph Shortest path tree IEEE 802.1aq Small-world network Graph theory Mathematics Theoretical computer science		doi:[removed]j.comnet[removed] Add to Reading List Source URL: jeremie.leguay.free.fr Download Document from Source Website File Size: 468,02 KB Share Document on Facebook

	A network reduction method inducing scale-free degree distribution Nicolas Martin, Paolo Frasca, Carlos Canudas de Wit To cite this version: Nicolas Martin, Paolo Frasca, Carlos Canudas de Wit. A network reduction method DocID: 1tVOv - View Document
	Accurate Estimation of the Degree Distribution of Private Networks Michael Hay, Chao Li, Gerome Miklau, and David Jensen Department of Computer Science University of Massachusetts Amherst {mhay, chaoli, miklau, jensen}@c DocID: 1tBQA - View Document
	Mean Field Variational Approximations in Continuous-Time Markov Processes A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science DocID: 1rlyc - View Document
	1 Determining local transientness of audio signals St´ephane Molla and Bruno Torr´esani Abstract— We describe a new method for estimating the degree DocID: 1rkDq - View Document
	OPEN SUBJECT AREAS: COMPLEX NETWORKS Activity clocks: spreading dynamics on temporal networks of human contact DocID: 1rjmg - View Document