Skip to main content
Conference Proceedings

Efficient parallel algorithms for path problems in planar directed graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1990) 450 LNCS 447-457
DOI: 10.1007/3-540-52921-7_94
8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a preprocessing of planar digraphs which yields processor-efficient, poly-log time algorithms for the single-source and all-pairs shortest-path problems, breadth-first search and reachability in planar digraphs.

Cite

CITATION STYLE

APA

Lingas, A. (1990). Efficient parallel algorithms for path problems in planar directed graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 450 LNCS, pp. 447–457). Springer Verlag. https://doi.org/10.1007/3-540-52921-7_94

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free