Using maximal independent sets to solve problems in parallel (Q672378): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2008807330
@@ Property / OpenAlex ID: W2008807330 / 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 @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+A new fixed point approach for stable networks and stable marriages
+Normal rank
@@ Property / cites work @@
+A New Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+Constructing a Maximal Independent Set in Parallel
+Normal rank
@@ Property / cites work @@
+An improved parallel algorithm for maximal matching
+Normal rank
@@ Property / cites work @@
+A fast parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+The complexity of circuit value and network stability
+Normal rank
@@ Property / cites work @@
+A parallelizable lexicographically first maximal edge-induced subgraph problem
+Normal rank
@@ Property / cites work @@
+\(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems
+Normal rank
@@ Property / cites work @@
+The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
+Normal rank
@@ Property / cites work @@
+On uniform circuit complexity
@@ Property / cites work: On uniform circuit complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Simulation of Parallel Random Access Machines by Circuits
+Normal rank