One-to-many node-disjoint paths of hyper-star networks (Q442216): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2012.04.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2154837657
@@ Property / OpenAlex ID: W2154837657 / rank @@
+Normal rank
@@ Property / cites work @@
+On Disjoint Shortest Paths Routing on the Hypercube
+Normal rank
@@ Property / cites work @@
+Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
+Normal rank
@@ Property / cites work @@
+Q3428666
@@ Property / cites work: Q3428666 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3429598
@@ Property / cites work: Q3429598 / rank @@
+Normal rank
@@ Property / cites work @@
+Longest fault-free paths in hypercubes with vertex faults
+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 @@
+Optimum broadcasting and personalized communication in hypercubes
+Normal rank
@@ Property / cites work @@
+Embedding hypercubes, rings, and odd graphs into hyper-stars
+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 @@
+Q4427279
@@ Property / cites work: Q4427279 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing vertex-disjoint paths in \((n, k)\)-star graphs
+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