A processor efficient MIS algorithm on random graphs (Q1318767): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(94)90094-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2069800464
@@ Property / OpenAlex ID: W2069800464 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast and simple randomized parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3975003
@@ Property / cites work: Q3975003 / rank @@
+Normal rank
@@ Property / cites work @@
+A review of random graphs
@@ Property / cites work: A review of random graphs / 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 @@
+Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
+Normal rank