Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees (Q3951561)
From MaRDI portal
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
