An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs (Q293380): Difference between revisions

@@ Property / cites work @@
+A group-theoretic model for symmetric interconnection networks
+Normal rank
@@ Property / cites work @@
+Q4000490
@@ Property / cites work: Q4000490 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Node-to-node cluster fault tolerant routing in star graphs
+Normal rank
@@ Property / cites work @@
+Node-to-set disjoint paths problem in star graphs
@@ Property / cites work: Node-to-set disjoint paths problem in star graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
+Normal rank
@@ Property / cites work @@
+On the existence of certain disjoint arcs in graphs
+Normal rank