Depth-First Search Using $$O(n)$$ Bits (Q2942660): Difference between revisions

@@ Property / author @@
-Tetsuo Asano
@@ Property / author: Tetsuo Asano / rank @@
-Normal rank
@@ Property / author @@
+Tetsuo Asano
@@ Property / author: Tetsuo Asano / rank @@
+Normal rank
@@ 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/978-3-319-13075-0_44
+Normal rank
@@ Property / OpenAlex ID @@
+W2284006119
@@ Property / OpenAlex ID: W2284006119 / 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 @@
+Parallelism and the maximal path problem
@@ Property / cites work: Parallelism and the maximal path problem / rank @@
+Normal rank
@@ Property / cites work @@
+Priority Queues and Sorting for Read-Only Data
@@ Property / cites work: Priority Queues and Sorting for Read-Only Data / rank @@
+Normal rank
@@ Property / cites work @@
+Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
+Normal rank
@@ Property / cites work @@
+$\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability
+Normal rank
@@ Property / cites work @@
+A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
+Normal rank
@@ Property / cites work @@
+Embedding and canonizing graphs of bounded genus in logspace
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+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 @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+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 @@
+Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems
+Normal rank
@@ Property / cites work @@
+Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search
+Normal rank