A variation on the min cut linear arrangement problem (Q3785979): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:28, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A variation on the min cut linear arrangement problem |
scientific article |
Statements
A variation on the min cut linear arrangement problem (English)
0 references
1987
0 references
embedding outerplanar graphs into spanning tree
0 references
min cut linear arrangement problem
0 references
NP-complete
0 references
linear-time algorithm
0 references
approximation algorithm
0 references
