Binary Pathfinder: An improvement to the Pathfinder algorithm

The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis of, amongst others, citations in BIS (bibliometrics, informetrics, and scientometrics). It has even been proposed for the online display of the search results in an information retrieval system. However, its great time and space complexity limits its use in real-time applications and in networks of any considerable size. The present work describes an improved algorithm with considerably reduced time and space complexity. Its lower execution costs thus increase its applicability both in real time and to large networks.

• Type: Journal
• Year: 2006
• Where: IPM
• Authors: Vicente P. Guerrero Bote, Felipe Zapico-Alonso, María Eugenia Espinosa-Calvo, Rocío Gómez Crisóstomo, Félix de Moya Anegón
• Keywords: Information Retrieval System, IPM 2006, Pathfinder Algorithm, Space Complexity