A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs (1993)
by
Philip N. Klein
,
Sairam Subramanian
| Citations: | 16 - 6 self |
BibTeX
@MISC{Klein93alinear-processor,
author = {Philip N. Klein and Sairam Subramanian},
title = {A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs},
year = {1993}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We give an algorithm requiring polylog time and a linear number of processors to solve singlesource shortest paths in directed planar graphs, bounded-genus graphs, and 2-dimensional overlap graphs. More generally, the algorithm works for any graph provided with a decomposition tree constructed using size-O( p n polylog n) separators.
