APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
From MaRDI portal
Publication:3991015
DOI10.1142/S0129053391000140zbMath0741.68043MaRDI QIDQ3991015
Publication date: 28 June 1992
Published in: International Journal of High Speed Computing (Search for Journal in Brave)
Related Items
Finding the maximum subsequence sum on interconnection networks, ANSV problem on BSRs, Solving the shortest-paths problem on bipartite permutation graphs efficiently, Randomized algorithm for the sum selection problem, Ranking \(k\) maximum sums, Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems, Efficient algorithms for the sum selection problem and \(k\) maximum sums problem, Two parallel algorithms for finding all minimal maximum subsequences