A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(96)00040-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2069194665
@@ Property / OpenAlex ID: W2069194665 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4099676
@@ Property / cites work: Q4099676 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
+Normal rank
@@ Property / cites work @@
+Parallel Symmetry-Breaking in Sparse Graphs
@@ Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing a Maximal Independent Set in Parallel
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of parallel search
@@ Property / cites work: The complexity of parallel search / rank @@
+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 @@
+Removing randomness in parallel computation without a processor penalty
+Normal rank