Finding the maximum subsequence sum on interconnection networks

DOI10.1080/17445760701207611MaRDI QIDQ5421615zbMATH OpenOpenAlexFDO

Authors Ke Qiu, Selim G. Akl

Publication date 24 October 2007

Published in International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/17445760701207611

zbMATH Keywords

Interconnection networksMax subsequence sum problemPRAMprefix sums

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Recommendations

• Finding maximum common biconnected subgraphs in series-parallel graphs
• Approximating the maximum consecutive subsums of a sequence
• Finding maximum subgraphs with relatively large vertex connectivity
• An Algorithm for a Generalized Maximum Subsequence Problem
• A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
• Complexity of min-max subsequence problems
• Two parallel algorithms for finding all minimal maximum subsequences
• A parallel algorithm for finding all minimal maximum subsequences via random walk
• On maximum common subgraph problems in series-parallel graphs
• On maximum common subgraph problems in series-parallel graphs

Cites work

• A group-theoretic model for symmetric interconnection networks
• A note on a standard strategy for developing loop invariants and loops
• A novel routing scheme on the star and pancake networks and its applications
• APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
• Fast parallel algorithms for the maximum sum problem
• scientific article; zbMATH DE number 42857 (Why is no real title available?)
• scientific article; zbMATH DE number 839552 (Why is no real title available?)

Cited in

(7)

• A parallel algorithm for finding the maximum value
• Two parallel algorithms for finding all minimal maximum subsequences
• A parallel algorithm for finding all minimal maximum subsequences via random walk
• Calculational developments of new parallel algorithms for size-constrained maximum-sum segment problems
• A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
• APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
• Fast parallel algorithms for the maximum sum problem

This page was built for publication: Finding the maximum subsequence sum on interconnection networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5421615)