Growing homophilic networks are natural optimal navigable small worlds

By Yu A. Malkov. 2015

Subfields: Graph Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Graph Learning

1. Dmitry A. Yashunin
2. Yury Malkov

Citations in the corpus

• Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs (2016, methodology): “Starting the search from the upper layer together with utilizing the scale separation boosts the performance compared to NSW and allows a logarithmic complexity scaling.”