Laying out sparse graphs with provably minimum bandwidth (Q2890478)
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 6044619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Laying out sparse graphs with provably minimum bandwidth |
scientific article; zbMATH DE number 6044619 |
Statements
8 June 2012
0 references
integer programming
0 references
branch and bound programming
0 references
Laying out sparse graphs with provably minimum bandwidth (English)
0 references
0.7901073694229126
0 references
0.7882805466651917
0 references
0.7878950834274292
0 references
0.7820723056793213
0 references
0.7789331674575806
0 references
