Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Linked
Hi-index | 0.00 |
We find the structural effect in geographical networks on the optimal paths and on the robustness of the connectivity. The communication efficiency are measured by the average path lengths and hops in the typical planar networks: Delaunay triangulation, random Apollonian network, and our proposed model with the well-balanced properties. The dynamic configuration will be useful especially for ad hoc communication.