A degree sequence method for the cutwidth problem of graphs (Q698370)
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: A degree sequence method for the cutwidth problem of graphs |
scientific article; zbMATH DE number 1802892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A degree sequence method for the cutwidth problem of graphs |
scientific article; zbMATH DE number 1802892 |
Statements
A degree sequence method for the cutwidth problem of graphs (English)
0 references
6 February 2003
0 references
bandwidth
0 references
labeling
0 references
0.7857946753501892
0 references
0.7783122062683105
0 references
0.7693570256233215
0 references
