Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem (Q3219762): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:03, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem |
scientific article |
Statements
Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem (English)
0 references
1984
0 references
