Improved parallel depth-first search in undirected planar graphs (Q5060132): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-57155-8_266
+Normal rank
@@ Property / OpenAlex ID @@
+W2097855961
@@ Property / OpenAlex ID: W2097855961 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple parallel tree contraction algorithm
@@ Property / cites work: A simple parallel tree contraction algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A random NC algorithm for depth first search
@@ Property / cites work: A random NC algorithm for depth first search / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Depth-First Search in General Directed Graphs
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic parallel list ranking
@@ Property / cites work: Deterministic parallel list ranking / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Euler tours in parallel
@@ Property / cites work: Finding Euler tours in parallel / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680833
@@ Property / cites work: Q3680833 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198785
@@ Property / cites work: Q4198785 / rank @@
+Normal rank
@@ Property / cites work @@
+The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
+Normal rank
@@ Property / cites work @@
+Faster optimal parallel prefix sums and list ranking
+Normal rank
@@ Property / cites work @@
+Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
+Normal rank
@@ Property / cites work @@
+Optimal parallel algorithms on planar graphs
@@ Property / cites work: Optimal parallel algorithms on planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Depth-First Search in $O(\log n)$ Parallel Time
+Normal rank
@@ Property / cites work @@
+An optimal linked list prefix algorithm on a local memory computer
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for series parallel graphs
+Normal rank
@@ Property / cites work @@
+A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for planar graph isomorphism and related problems
+Normal rank
@@ Property / cites work @@
+Q3798260
@@ Property / cites work: Q3798260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3798226
@@ Property / cites work: Q3798226 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Prefix Computation
@@ Property / cites work: Parallel Prefix Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Finding small simple cycle separators for 2-connected planar graphs
+Normal rank
@@ Property / cites work @@
+Depth-first search is inherently sequential
@@ Property / cites work: Depth-first search is inherently sequential / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Algorithms for Depth-First Searches I. Planar Graphs
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216652
@@ Property / cites work: Q3216652 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684700
@@ Property / cites work: Q5684700 / rank @@
+Normal rank