A reduction of the logspace shortest path problem to biconnected graphs
Computational Complexity
2015-11-24 v1
Abstract
In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest path algorithm for general graphs which uses a logspace shortest path oracle for biconnected graphs. We also present a linear time logspace shortest path algorithm for graphs with bounded vertex degree and biconnected component size, which does not rely on an oracle. The asymptotic time-space product of this algorithm is the best possible among all shortest path algorithms.
Cite
@article{arxiv.1511.07100,
title = {A reduction of the logspace shortest path problem to biconnected graphs},
author = {Boris Brimkov},
journal= {arXiv preprint arXiv:1511.07100},
year = {2015}
}
Comments
9 pages