Strong SDP based bounds on the cutwidth of a graph (Q6065655)
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 7765557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong SDP based bounds on the cutwidth of a graph |
scientific article; zbMATH DE number 7765557 |
Statements
Strong SDP based bounds on the cutwidth of a graph (English)
0 references
15 November 2023
0 references
cutwidth
0 references
linear ordering
0 references
semidefinite programming
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
