Finding the maximum subsequence sum on interconnection networks (Q5421615): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/17445760701207611
+Normal rank
@@ Property / OpenAlex ID @@
+W2028128008
@@ Property / OpenAlex ID: W2028128008 / rank @@
+Normal rank
@@ Property / cites work @@
+A group-theoretic model for symmetric interconnection networks
+Normal rank
@@ Property / cites work @@
+APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
+Normal rank
@@ Property / cites work @@
+A novel routing scheme on the star and pancake networks and its applications
+Normal rank
@@ Property / cites work @@
+Q3992623
@@ Property / cites work: Q3992623 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on a standard strategy for developing loop invariants and loops
+Normal rank
@@ Property / cites work @@
+Q4864245
@@ Property / cites work: Q4864245 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast parallel algorithms for the maximum sum problem
+Normal rank