Constructing disjoint paths on expander graphs (Q1262782): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenvalues and expanders
@@ Property / cites work: Eigenvalues and expanders / rank @@
+Normal rank
@@ Property / cites work @@
+Expanding graphs contain all small trees
@@ Property / cites work: Expanding graphs contain all small trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel hashing
@@ Property / cites work: Parallel hashing / 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 @@
+Q3048571
@@ Property / cites work: Q3048571 / 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 @@
+The Token Distribution Problem
@@ Property / cites work: The Token Distribution Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. VI. Disjoint paths across a disc
@@ Property / cites work: Graph minors. VI. Disjoint paths across a disc / rank @@
+Normal rank
@@ Property / cites work @@
+A Scheme for Fast Parallel Communication
@@ Property / cites work: A Scheme for Fast Parallel Communication / rank @@
+Normal rank