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

	Transactions in GIS, 2005, 9(4): 475– 488 Research Article A Structural Perspective on Visibility Patterns with a Topographic Surface DocID: 1oUvQ - View Document
	Online Appendix: Network Methods [Systemic Loops and Liquidity Regulation], by Iñaki Aldasoro and Ester Faia This appendix presents more formal detail regarding the network measures used to characterize the simulated in DocID: 1ngzm - View Document
	American Journal of Sociology between arbitrary pairs of points (with some limitation on length of path considered) can then be computed. The contention here is that removal of the average weak tie would do more " DocID: 1l2JZ - View Document
	PDF Document DocID: 18DIM - View Document
	work’s links were simply determined by a completely random process. • The degree distribution of networks tends to exhibit “fat tails” and often approximate a “scalefree” or “power-law” distribution. Thus DocID: 17XSh - View Document