An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218): Difference between revisions

@@ Property / author @@
-Q290216
@@ Property / author: Q290216 / rank @@
-Normal rank
@@ Property / author @@
-Richard Chia-Tung Lee
@@ Property / author: Richard Chia-Tung Lee / rank @@
-Normal rank
@@ Property / author @@
+Fang-Rong Hsu
@@ Property / author: Fang-Rong Hsu / rank @@
+Normal rank
@@ Property / author @@
+Richard Chia-Tung Lee
@@ Property / author: Richard Chia-Tung Lee / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for permutation graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
+Normal rank
@@ Property / cites work @@
+An Efficient Parallel Biconnectivity Algorithm
@@ Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(97)00009-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2053724095
@@ Property / OpenAlex ID: W2053724095 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:290218