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. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Assignments of Numbers to Vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The space complexity of pebble games on trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048639 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Minimum Linear Arrangement Algorithm for Undirected Trees / rank | |||
Normal rank | |||
Latest revision as of 16:22, 13 June 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
