A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
From MaRDI portal
Publication:3525771
DOI10.1007/11682462_33zbMath1145.68585OpenAlexW1533815075MaRDI QIDQ3525771
Publication date: 18 September 2008
Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11682462_33
Related Items (3)
Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence ⋮ Two parallel algorithms for finding all minimal maximum subsequences ⋮ Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence
This page was built for publication: A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
