A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534)
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 5284980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Lower Bound for the Minimum Linear Arrangement of a Graph |
scientific article; zbMATH DE number 5284980 |
Statements
A New Lower Bound for the Minimum Linear Arrangement of a Graph (English)
0 references
5 June 2008
0 references
linear arrangement problem
0 references
polyhedral combinatorics
0 references
cutting planes
0 references
0 references
0.8992285132408142
0 references
0.8730993270874023
0 references
0.8726832866668701
0 references
0.8702237606048584
0 references
0.8427362442016602
0 references
