Single source shortest paths in $H$-minor free graphs
| dc.creator | Yuster, Raphael | |
| dc.date | 2008-09-17 | |
| dc.date.accessioned | 2026-07-07T10:03:32Z | |
| dc.date.available | 2026-07-07T10:03:32Z | |
| dc.description | We present an algorithm for the Single Source Shortest Paths (SSSP) problem in \emph{$H$-minor free} graphs. For every fixed $H$, if $G$ is a graph with $n$ vertices having integer edge lengths and $s$ is a designated source vertex of $G$, the algorithm runs in $\tilde{O}(n^{\sqrt{11.5}-2} \log L) \le O(n^{1.392} \log L)$ time, where $L$ is the absolute value of the smallest edge length. The algorithm computes shortest paths and the distances from $s$ to all vertices of the graph, or else provides a certificate that $G$ is not $H$-minor free. Our result improves an earlier $O(n^{1.5} \log L)$ time algorithm for this problem, which follows from a general SSSP algorithm of Goldberg. | |
| dc.identifier | https://arxiv.org/abs/0809.2970 | |
| dc.identifier | http://arxiv.org/abs/0809.2970 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/169321 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Single source shortest paths in $H$-minor free graphs | |
| dc.type | text |