A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
2019 International Conference on Computational Science and Computational Intelligence (CSCI)
Random geometric (hyperbolic) graphs are important modeling tools in analyzing real-world complex networks. Greedy navigation (routing) is one of the most promising information forwarding mechanisms in complex networks. This paper is dealing with greedy navigability of complex graphs generated by using a metric (hyperbolic) space. Greedy navigability means that every source-destination pairs in the graph can communicate in such a way that every node passes the information towards thatdoi:10.1109/csci49370.2019.00092 fatcat:s7hwb2o4prezjl63cfipnjs2i4