Fully Dynamic Shortest Paths in Sparse Digraphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916370048876544 |
|---|---|
| author | Karczmarz, Adam Sankowski, Piotr |
| author_facet | Karczmarz, Adam Sankowski, Piotr |
| contents | We study the exact fully dynamic shortest paths problem. For real-weighted directed graphs, we show a deterministic fully dynamic data structure with $\tilde{O}(mn^{4/5})$ worst-case update time processing arbitrary $s,t$-distance queries in $\tilde{O}(n^{4/5})$ time. This constitutes the first non-trivial update/query tradeoff for this problem in the regime of sparse weighted directed graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_14406 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fully Dynamic Shortest Paths in Sparse Digraphs Karczmarz, Adam Sankowski, Piotr Data Structures and Algorithms We study the exact fully dynamic shortest paths problem. For real-weighted directed graphs, we show a deterministic fully dynamic data structure with $\tilde{O}(mn^{4/5})$ worst-case update time processing arbitrary $s,t$-distance queries in $\tilde{O}(n^{4/5})$ time. This constitutes the first non-trivial update/query tradeoff for this problem in the regime of sparse weighted directed graphs. |
| title | Fully Dynamic Shortest Paths in Sparse Digraphs |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2408.14406 |