Solving the shortest-paths problem on bipartite permutation graphs efficiently
type: Item
instance of: scholarly article
title: Solving the shortest-paths problem on bipartite permutation graphs efficiently
zbMATH Open document ID: 0875.68502
DOI: 10.1016/0020-0190(95)00084-P
author: Lin Chen
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 985118
zbMATH Keywords: Parallel algorithms
zbMATH Keywords: Shortest paths
zbMATH Keywords: Bipartite permutation graphs
zbMATH Keywords: Upper and lower bounds
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
cites work: Q3484355
cites work: APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
cites work: Optimal parallel time bounds for the maximum clique problem on intervals
cites work: Efficient parallel algorithms for bipartite permutation graphs
cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
cites work: Parallel Matrix and Graph Algorithms
cites work: A note on two problems in connexion with graphs
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs
cites work: Bipartite permutation graphs
cites work: A new upper bound on the complexity of the all pairs shortest path problem
cites work: An Efficient Parallel Biconnectivity Algorithm
cites work: A Theorem on Boolean Matrices
description: scientific article; zbMATH DE number 985118