The lexicographically first topological order problem is NLOG-complete (Q582104): Difference between revisions

@@ Property / cites work @@
+Parallelism and the maximal path problem
@@ Property / cites work: Parallelism and the maximal path problem / rank @@
+Normal rank
@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Parallel Matrix and Graph Algorithms
@@ Property / cites work: Parallel Matrix and Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3783600
@@ Property / cites work: Q3783600 / rank @@
+Normal rank
@@ Property / cites work @@
+A parallelizable lexicographically first maximal edge-induced subgraph problem
+Normal rank
@@ Property / cites work @@
+Q3795248
@@ Property / cites work: Q3795248 / 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 @@
+Q3815544
@@ Property / cites work: Q3815544 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4010349
@@ Property / cites work: Q4010349 / rank @@
+Normal rank