Approximating max-cut under graph-MSO constraints (Q2294245)
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 7165735
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating max-cut under graph-MSO constraints |
scientific article; zbMATH DE number 7165735 |
Statements
Approximating max-cut under graph-MSO constraints (English)
0 references
10 February 2020
0 references
max cut
0 references
approximation algorithm
0 references
monadic second-order logic
0 references
treewidth
0 references
dynamic program
0 references
0 references
0 references
0 references
0.8468924164772034
0 references
0.8263795971870422
0 references
0.7737579941749573
0 references
0.7730470895767212
0 references
0.7686739563941956
0 references
