A polynomial algorithm for the min-cut linear arrangement of trees (Q3771641)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4031008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for the min-cut linear arrangement of trees |
scientific article; zbMATH DE number 4031008 |
Statements
A polynomial algorithm for the min-cut linear arrangement of trees (English)
0 references
1985
0 references
cutwidth
0 references
min-cut linear arrangement
0 references
0.8772704601287842
0 references
0.8352147936820984
0 references
0.8230153918266296
0 references
0.813318133354187
0 references
