Back to Results
First PageMeta Content
Network theory / Random graphs / Scale-free network / Shortest path problem / Giant component / Graph / Networks / Graph theory / Mathematics / Theoretical computer science


Typical distances in ultrasmall random networks
Add to Reading List

Document Date: 2011-04-07 12:39:44

Open Document

File Size: 349,60 KB

Share Result on Facebook

IndustryTerm

scale-free networks / ultrasmall random networks / configuration networks / preferential attachment networks / power-law exponent / /

SocialTag