Verifying Shortest Paths in Linear Time
Ahmed Shokry, Amr Elmasry, Ayman Khalafallah, Amr Aly
TL;DR
This paper introduces a linear-time certifying algorithm for the single-source shortest-path problem that can verify graphs with positive, negative, and zero arc weights, extending previous methods limited to positive weights.
Contribution
The paper presents the first linear-time certifying algorithm capable of handling graphs with positive, negative, and zero arc weights for shortest-path verification.
Findings
Algorithm runs in linear time
Handles graphs with negative and zero weights
Provides certifiable verification of shortest paths
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Data Management and Algorithms · Formal Methods in Verification