A variation on the min cut linear arrangement problem (Q3785979)
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 4049087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variation on the min cut linear arrangement problem |
scientific article; zbMATH DE number 4049087 |
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
0.95627487
0 references
0.9300343
0 references
0.8941636
0 references
0.88848716
0 references
0.88492304
0 references
0.88492304
0 references
0.87969023
0 references
0.87915826
0 references
0 references
