Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. | 0 | 0.34 | 2021 |
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs | 0 | 0.34 | 2019 |
Hyperbolic Embeddings for Near-Optimal Greedy Routing | 2 | 0.36 | 2018 |
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. | 0 | 0.34 | 2018 |
Unbounded Discrepancy of Deterministic Random Walks on Grids. | 1 | 0.40 | 2015 |