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...

Celý popis

Podrobná bibliografia

Vydané v:	2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) Ročník 1; s. 27 - 34
Hlavní autori:	Takes, Frank W., Kosters, Walter A.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.08.2014
Predmet:	Accuracy Approximation methods distances Estimation graphs landmarks Memory management Optimization shortest paths Time complexity
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!