An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365): Difference between revisions

@@ Property / author @@
-Madhumangal Pal
@@ Property / author: Madhumangal Pal / rank @@
-Normal rank
@@ Property / author @@
-Tapan Kumar Pal
@@ Property / author: Tapan Kumar Pal / rank @@
-Normal rank
@@ Property / author @@
+Madhumangal Pal
@@ Property / author: Madhumangal Pal / rank @@
+Normal rank
@@ Property / author @@
+Tapan Kumar Pal
@@ Property / author: Tapan Kumar Pal / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 97
@@ Property / describes a project that uses: Algorithm 97 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster algorithms for the shortest path problem
@@ Property / cites work: Faster algorithms for the shortest path problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the exponent of all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+A unified approach to parallel depth-first traversals of general trees
+Normal rank
@@ Property / cites work @@
+Breadth-first traversal of trees and integer sorting in parallel
+Normal rank
@@ Property / cites work @@
+Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q3140413
@@ Property / cites work: Q3140413 / rank @@
+Normal rank
@@ Property / cites work @@
+All pairs shortest distances for graphs with small integer length edges
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
+Normal rank
@@ Property / cites work @@
+Q4887753
@@ Property / cites work: Q4887753 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385175
@@ Property / cites work: Q4385175 / rank @@
+Normal rank
@@ Property / cites work @@
+One-dimensional logic gate assignment and interval graphs
+Normal rank
@@ Property / cites work @@
+An optimal algorithm to solve the all-pair shortest path problem on interval graphs
+Normal rank
@@ Property / cites work @@
+An Efficient Test for Circular-Arc Graphs
@@ Property / cites work: An Efficient Test for Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02936037
+Normal rank
@@ Property / OpenAlex ID @@
+W2159279760
@@ Property / OpenAlex ID: W2159279760 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1767365