This project is for the landmark system into finding closest pairs in a graph like structure, towards the need of a fast and accurate measurements of this type of metric in Social Networks. We adapt a landmark system already and improve by using more complex metrics than applied in the original paper [Michalis]
- [Michalis] Michalis Potamias, Francesco Bonchi, Carlos Castillo, andAristides Gionis.Fast shortest path distance estimation in large networks.InProceedings of the 18th ACM Conference on Informationand Knowledge Management, CIKM ’09, pages 867–876, NewYork, NY, USA, 2009. ACM.