Adaptive Landmark Selection Strategies for Fast Shortest Path Computation in Large Real-World Graphs

This paper considers the task of answering shortest path queries in large real-world graphs such as social networks, communication networks and web graphs. The traditional Breadth First Search (BFS) approach for solving this problem is too time-consuming when networks with millions of nodes and poss...

Full description

Bibliographic Details

Published in:	2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) Vol. 1; pp. 27 - 34
Main Authors:	Takes, Frank W., Kosters, Walter A.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.08.2014
Subjects:	Accuracy Approximation methods distances Estimation graphs landmarks Memory management Optimization shortest paths Time complexity
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!