Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem (Q3219762): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(84)90006-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084182003 / rank | |||
Normal rank | |||
Latest revision as of 23:43, 19 March 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
