Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees (Q3951561): 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.1137/0603010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1970580433 / rank | |||
Normal rank | |||
Revision as of 00:11, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees |
scientific article |
Statements
Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees (English)
0 references
1982
0 references
one-dimensional layout problems for undirected graphs
0 references
VSLI design
0 references
polynomial time algorithm
0 references
m-ary trees
0 references
