Bellman-Ford in Almost-Linear Time for Dense Graphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914336280150016 |
|---|---|
| author | Li, George Z. Li, Jason Zhang, Junkai |
| author_facet | Li, George Z. Li, Jason Zhang, Junkai |
| contents | We consider the single-source shortest paths problem on a directed graph with real-valued (possibly negative) edge weights and solve this problem in $n^{2+o(1)}$ time by refining the shortcutting procedure introduced in Li, Li, Rao, and Zhang (2026). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_16153 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Bellman-Ford in Almost-Linear Time for Dense Graphs Li, George Z. Li, Jason Zhang, Junkai Data Structures and Algorithms We consider the single-source shortest paths problem on a directed graph with real-valued (possibly negative) edge weights and solve this problem in $n^{2+o(1)}$ time by refining the shortcutting procedure introduced in Li, Li, Rao, and Zhang (2026). |
| title | Bellman-Ford in Almost-Linear Time for Dense Graphs |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2602.16153 |