An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
type: Item
instance of: scholarly article
title: An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
zbMATH Open document ID: 1102.68137
DOI: 10.1007/BF02936037
author: Anita Saha
author: Madhumangal Pal
author: Tapan K. Pal
published in: Journal of Applied Mathematics and Computing
publication date: 2005-03-10T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2143244
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
cites work: Q4091421
cites work: Faster algorithms for the shortest path problem
cites work: On the exponent of all pairs shortest path problem
cites work: A unified approach to parallel depth-first traversals of general trees
cites work: Breadth-first traversal of trees and integer sorting in parallel
cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
cites work: Q3140413
cites work: All pairs shortest distances for graphs with small integer length edges
cites work: Q3328583
cites work: Efficient algorithms for interval graphs and circular-arc graphs
cites work: An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
cites work: Q4887753
cites work: Q4385175
cites work: One-dimensional logic gate assignment and interval graphs
cites work: An optimal algorithm to solve the all-pair shortest path problem on interval graphs
cites work: An Efficient Test for Circular-Arc Graphs
full work available at URL: https://doi.org/10.1007/bf02936037
OpenAlex ID: W2159279760
Recommended article: Q3361906
Recommended article: Optimal parallel algorithms on circular-arc graphs
Recommended article: Q3542693
Recommended article: Q5289052
Recommended article: Q4385175
Recommended article: Q4005371
Recommended article: Parallel algorithms on circular-arc graphs
Recommended article: Efficient parallel algorithms for computing all pair shortest paths in directed graphs
Recommended article: Q4321477
description: scientific article; zbMATH DE number 2143244