An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908399587819520 |
|---|---|
| author | de Berg, Mark Cabello, Sergio |
| author_facet | de Berg, Mark Cabello, Sergio |
| contents | We prove that the single-source shortest-path problem on disk graphs can be solved in $O(n\log n)$ time, and that it can be solved on intersection graphs of fat triangles in $O(n\log^2 n)$ time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_07571 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs de Berg, Mark Cabello, Sergio Computational Geometry We prove that the single-source shortest-path problem on disk graphs can be solved in $O(n\log n)$ time, and that it can be solved on intersection graphs of fat triangles in $O(n\log^2 n)$ time. |
| title | An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2506.07571 |