Overview

The landmarksel project consists of simple and fast methods to select a set of landmarks in large undirected graphs. Landmarks (aka beacons, reference points) are central nodes of the graph and are commonly used for shortest path estimation. All the landmark selection methods are described in the paper below.

The distribution contains a command line menu and an example with a sample graph. For inquiries, contact any of the authors of the article below.

Credits/Reference

Michalis Potamias, Francesco Bonchi, Carlos Castillo, and Aristides Gionis: "Fast shortest path distance estimation in large networks" In Proceeding of the 18th ACM conference on Information and knowledge management (CIKM '09), Hong Kong, PRC. Pages 867-876. 2009.

Download paper / ACM link / Slideshow

License

This software is distributed under the GPL license.