Tag Archives: exploration

Plots

Random graph exploration with shortest paths

Random graph exploration with shortest paths

> Matthieu Latapy and Jean-Loup Guillaume A random graph of n nodes may be constructed by adding each possible link with a given probability p. The obtained graph then has density p. One may roughly model traceroute measurements of the internet topology from one monitor as the collection of all shortest paths from this monitor […]

Posted in Plots | Also tagged , |