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 this page instead for the normal view: Laying out sparse graphs with provably minimum bandwidth |
scientific article; zbMATH DE number 6044619
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
