Finding the maximum subsequence sum on interconnection networks (Q5421615): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/17445760701207611 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028128008 / rank | |||
Normal rank | |||
Revision as of 19:29, 19 March 2024
scientific article; zbMATH DE number 5204523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the maximum subsequence sum on interconnection networks |
scientific article; zbMATH DE number 5204523 |
Statements
Finding the maximum subsequence sum on interconnection networks (English)
0 references
24 October 2007
0 references
Interconnection networks
0 references
Max subsequence sum problem
0 references
prefix sums
0 references
PRAM
0 references
