Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.06121 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915054764425216 |
|---|---|
| author | Shokry, Ahmed Elmasry, Amr Khalafallah, Ayman Aly, Amr |
| author_facet | Shokry, Ahmed Elmasry, Amr Khalafallah, Ayman Aly, Amr |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_06121 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Verifying Shortest Paths in Linear Time Shokry, Ahmed Elmasry, Amr Khalafallah, Ayman Aly, Amr Data Structures and Algorithms 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. |
| title | Verifying Shortest Paths in Linear Time |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2412.06121 |