Efficient parallel algorithms for shortest paths in planar digraphs
type: Item
instance of: scholarly article
title: Efficient parallel algorithms for shortest paths in planar digraphs
zbMATH Open document ID: 0761.68047
DOI: 10.1007/BF01994878
author: Grammati Pantziou
author: Christos Zaroliagis
author: P. G. Spirakis
published in: BIT
publication date: 1992-12-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 79060
zbMATH Keywords: planar digraph
zbMATH Keywords: outerplanar digraph
zbMATH Keywords: compact routing tables
zbMATH Keywords: parallel tree contraction
zbMATH Keywords: CREW PRAM
zbMATH Keywords: shortest path
zbMATH Keywords: hammock-decomposition technique
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
cites work: A simple parallel tree contraction algorithm
cites work: On the Complexity of Covering Vertices by Faces in a Planar Graph
cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
cites work: A note on two problems in connexion with graphs
cites work: Parallel Matrix and Graph Algorithms
cites work: Q4036575
cites work: Designing networks with compact routing tables
cites work: Planar graph decomposition and all pairs shortest paths
cites work: New Bounds on the Complexity of the Shortest Path Problem
cites work: Optimal parallel algorithms on planar graphs
cites work: Q4385522
cites work: Q3711761
full work available at URL: https://doi.org/10.1007/bf01994878
OpenAlex ID: W1971715758
description: scientific article; zbMATH DE number 79060