Efficient parallel algorithms for path problems in planar directed graphs

Authors:
Andrzej Lingas
Affiliations:
-
Venue:
SIGAL '90 Proceedings of the international symposium on Algorithms
Year:
1990

Citing 0
Cited 2

Efficient parallel algorithms for computing all pair shortest paths in directed graphs

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Efficient parallel shortest-paths in digraphs with a separator decomposition

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract