HIGHLIGHTS
- who: Carlo Vittorio Cannistraci from the Center for Complex Network Intelligence (CCNI), Tsinghua Laboratory of Brain and Intelligence (THBI), Tsinghua University, Beijing, China Department of have published the paper: Geometrical congruence, greedy navigability and myopic transfer in complex networks and brain connectomes, in the Journal: (JOURNAL)
- what: The authors propose an optimized algorithm that reduces 26 years of worst scenario computation to one week parallel computing. The main reason behind this phenomenon is assumed the proximity of topological shortest paths (TSP) in the hyperbolic networks to the corresponding geodesics in the underlying hyperbolic geometry. Specifically . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.