Fast Generation of Spatially Embedded Random Networks
Not on the map. Why?
Abstract (arXiv)
Spatially Embedded Random Networks such as the Waxman random graph have been used in a variety of settings for synthesizing networks. However, little thought has been put into fast generation of these networks. Existing techniques are O(n2) where n is the number of nodes in the graph. In this paper we present an O(n + e) algorithm, where e is the number of edges.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 11 Dec 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.