Optimal computation of shortest paths on doubly convex bipartite graphs
From MaRDI portal
Publication:1963107
DOI10.1016/S0898-1221(99)00201-1zbMath0931.90061MaRDI QIDQ1963107
Publication date: 20 January 2000
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distributed algorithms (68W15)
Related Items (max. 100)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Efficient parallel algorithms for doubly convex-bipartite graphs
- Solving the shortest-paths problem on bipartite permutation graphs efficiently
- Matrix multiplication via arithmetic progressions
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- Bipartite permutation graphs
- Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
- Optimal parallel time bounds for the maximum clique problem on intervals
- A new upper bound on the complexity of the all pairs shortest path problem
- Parallel recognition of the consecutive ones property with applications
- An Efficient Parallel Biconnectivity Algorithm
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- ON THE POWER OF SOME PRAM MODELS
- The Parallel Evaluation of General Arithmetic Expressions
- Efficient parallel algorithms for bipartite permutation graphs
- A Theorem on Boolean Matrices
This page was built for publication: Optimal computation of shortest paths on doubly convex bipartite graphs
