Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence (Q501652)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence |
scientific article |
Statements
Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence (English)
0 references
9 January 2017
0 references
maximal sum subsequence
0 references
multiple insertions into a sequence
0 references
circular subsequence
0 references
FIFO order
0 references
priority queue
0 references
0.7550768852233887
0 references
0.7451772093772888
0 references
0.7439287900924683
0 references
0.7430165410041809
0 references
