Proxies for Shortest Path and Distance Queries.
IEEE Transactions on Knowledge and Data Engineering(2017)
摘要
Computing shortest paths and distances is one of the fundamental problems on graphs, and it remains a challenging task today. This article investigates a light-weight data reduction technique for speeding-up shortest path and distance queries on large graphs. To do this, we propose a notion of routing proxies (or simply proxies), each of which represents a small subgraph, referred to as determinis...
更多查看译文
关键词
Routing,Gold,Roads,Algorithm design and analysis,Social network services,Indexes,Data preprocessing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要