<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Network theory / Networks / Edsger W. Dijkstra / Shortest path problem / Small-world network / Peter Killworth / Markov chain / Conceptual model / Path
Date: 2007-06-20 07:27:56
Graph theory
Mathematics
Network theory
Networks
Edsger W. Dijkstra
Shortest path problem
Small-world network
Peter Killworth
Markov chain
Conceptual model
Path

Social Networks–96 The accuracy of small world chains in social networks Peter D. Killworth a,∗ , Christopher McCarty b , H. Russell Bernard c , Mark House b

Add to Reading List

Source URL: nersp.nerdc.ufl.edu

Download Document from Source Website

File Size: 465,34 KB

Share Document on Facebook

Similar Documents

An Interview with Edsger W. Dijkstra OH 330 Conducted by Philip L. Frana on

An Interview with Edsger W. Dijkstra OH 330 Conducted by Philip L. Frana on

DocID: 1t5Ar - View Document

What can we learn from Edsger W. Dijkstra? by Tony Hoare. 0. Preamble I would like to start by joining all of you in the expression of deep gratitude to Schlumberger for the grant which set up a series of lectures to hon

What can we learn from Edsger W. Dijkstra? by Tony Hoare. 0. Preamble I would like to start by joining all of you in the expression of deep gratitude to Schlumberger for the grant which set up a series of lectures to hon

DocID: 1stfp - View Document

PADTAD 2012 Curriculum for software development with concurrency - Jeremy S. Bradbury, João M. Lourenço, Ok-Kyoon Ha, In-Bon Kuh, Yong-Kee Jun Funding provided by:  Concurrency – Education

PADTAD 2012 Curriculum for software development with concurrency - Jeremy S. Bradbury, João M. Lourenço, Ok-Kyoon Ha, In-Bon Kuh, Yong-Kee Jun Funding provided by: Concurrency – Education

DocID: 1rqUv - View Document

Parallel Processing Letters c World Scientific Publishing Company ⃝ SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE

Parallel Processing Letters c World Scientific Publishing Company ⃝ SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE

DocID: 1rqFm - View Document

Call for Papers  Programming for Separation of Concerns (6th edition) http://www.dmi.unict.it/~tramonta/PSC10/

Call for Papers Programming for Separation of Concerns (6th edition) http://www.dmi.unict.it/~tramonta/PSC10/

DocID: 1rpw5 - View Document