Pruned labeling algorithms: fast, exact, dynamic, simple and general indexing scheme for shortest-path queries

@inproceedings{Akiba2014PrunedLA,
  title={Pruned labeling algorithms: fast, exact, dynamic, simple and general indexing scheme for shortest-path queries},
  author={Takuya Akiba},
  booktitle={WWW},
  year={2014}
}
Shortest-paths and distances are two of the most fundamental notions for pairs of nodes on a network, and thus they play an important role in a wide range of applications such as network analysis and network-aware search. In this talk, I will introduce our indexing method for efficiently answering shortest-paths, referred to as pruned landmark labeling… CONTINUE READING