A parallel algorithm for the maximum 2-chain edge packing problem (Q1123636): Difference between revisions

@@ 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 @@
+Finding Euler tours in parallel
@@ Property / cites work: Finding Euler tours in parallel / rank @@
+Normal rank
@@ Property / cites work @@
+An improved parallel algorithm for maximal matching
+Normal rank
@@ Property / cites work @@
+Constructing a perfect matching is in random NC
@@ Property / cites work: Constructing a perfect matching is in random NC / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of General Graph Factor Problems
+Normal rank
@@ Property / cites work @@
+Chain packing in graphs
@@ Property / cites work: Chain packing in graphs / 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 @@
+An O(logn) parallel connectivity algorithm
@@ Property / cites work: An O(logn) parallel connectivity algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Implementation of simultaneous memory address access in models that forbid it
+Normal rank