Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341): Difference between revisions

@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Many-to-many disjoint paths in faulty hypercubes
@@ Property / cites work: Many-to-many disjoint paths in faulty hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+On Disjoint Shortest Paths Routing on the Hypercube
+Normal rank
@@ Property / cites work @@
+On the Rabin number problem
@@ Property / cites work: On the Rabin number problem / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial properties of generalized hypercube graphs
+Normal rank
@@ Property / cites work @@
+Longest fault-free paths in hypercubes with vertex faults
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding maximum matching in graphs
+Normal rank
@@ Property / cites work @@
+From Hall's matching theorem to optimal routing on hypercubes
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
+Normal rank
@@ Property / cites work @@
+Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
+Normal rank
@@ Property / cites work @@
+Strong Rabin numbers of folded hypercubes
@@ Property / cites work: Strong Rabin numbers of folded hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+<i>w</i> -Rabin numbers and strong <i>w</i> -Rabin numbers of folded hypercubes
+Normal rank
@@ Property / cites work @@
+Generalized diameters and Rabin numbers of networks
+Normal rank
@@ Property / cites work @@
+Efficient dispersal of information for security, load balancing, and fault tolerance
+Normal rank
@@ Property / cites work @@
+Node-disjoint paths in hierarchical hypercube networks
+Normal rank