Verifying Shortest Paths in Linear Time
Data Structures and Algorithms
2024-12-10 v1
Abstract
In this paper we propose a linear-time certifying algorithm for the single-source shortest-path problem capable of verifying graphs with positive, negative, and zero arc weights. Previously proposed linear-time approaches only work for graphs with positive arc weights.
Keywords
Cite
@article{arxiv.2412.06121,
title = {Verifying Shortest Paths in Linear Time},
author = {Ahmed Shokry and Amr Elmasry and Ayman Khalafallah and Amr Aly},
journal= {arXiv preprint arXiv:2412.06121},
year = {2024}
}