Robust Distance Queries on Massive Networks.
ALGORITHMS - ESA 2014(2014)
摘要
We present a versatile and scalable algorithm for computing exact distances on real-world networks with tens of millions of arcs in real time. Unlike existing approaches, preprocessing and queries are practical on a wide variety of inputs, such as social, communication, sensor, and road networks. We achieve this by providing a unified approach based on the concept of 2-hop labels, improving upon existing methods. In particular, we introduce a fast sampling-based algorithm to order vertices by importance, as well as effective compression techniques.
更多查看译文
关键词
Short Path, Road Network, Betweenness Centrality, Query Time, Graph Class
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络