A note on parallel complexity of maximum \(f\)-matching (Q293199): Difference between revisions

@@ Property / cites work @@
+Q4525709
@@ Property / cites work: Q4525709 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4268439
@@ Property / cites work: Q4268439 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Merge Sort
@@ Property / cites work: Parallel Merge Sort / rank @@
+Normal rank
@@ Property / cites work @@
+On parallel complexity of maximum f-matching and the degree sequence problem
+Normal rank
@@ Property / cites work @@
+PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS
+Normal rank
@@ Property / cites work @@
+Improved processor bounds for combinatorial problems in RNC
+Normal rank
@@ Property / cites work @@
+A Las Vegas RNC algorithm for maximum matching
@@ Property / cites work: A Las Vegas RNC algorithm for maximum matching / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+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 @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+A Short Proof of the Factor Theorem for Finite Graphs
+Normal rank