Top-k Shortest Paths in Directed Labeled Multigraphs

@inproceedings{Hertling2016TopkSP,
  title={Top-k Shortest Paths in Directed Labeled Multigraphs},
  author={Sven Hertling and Markus Schr{\"o}der and Christian Jilek and Andreas Dengel},
  booktitle={SemWebEval@ESWC},
  year={2016}
}
A top-k shortest path algorithm finds the k shortest paths of a given graph ordered by length. Interpreting graphs as RDF may lead to additional constraints, such as special loop restrictions or path patterns. Thus, traditional algorithms such as the ones by Dijkstra, Yen or Eppstein cannot be applied without further ado. We therefore implemented a solution method based on Eppstein’s algorithm which is thoroughly discussed in this paper. Using this method we were able to solve all tasks of the… CONTINUE READING

Similar Papers

Loading similar papers…