The diameter of random massive graphs
From MaRDI portal
Recommendations
Cited in
(9)- Energy efficient randomised communication in unknown AdHoc networks
- Diameters of random circulant graphs
- The impact of dynamic events on the number of errors in networks
- An estimate of the probability of localisation of the diameter of a random scale-free graph
- A random graph model for massive graphs
- scientific article; zbMATH DE number 2076942 (Why is no real title available?)
- The diameter of sparse random graphs
- A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
- The diameter of sparse random graphs
This page was built for publication: The diameter of random massive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768399)