Single source shortest paths in $H$-minor free graphs

Details Single source shortest paths in $H$-minor free graphs Single source shortest paths in $H$-minor free graphs

2008-09-17

arxiv.org/abs/0809.2970v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Single source shortest paths in $H$-minor free graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Single source shortest paths in $H$-minor free graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Single source shortest paths in $H$-minor free graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-661867