A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs (Q1670994)
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 fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs |
scientific article; zbMATH DE number 6932699
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs |
scientific article; zbMATH DE number 6932699 |
Statements
A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs (English)
0 references
6 September 2018
0 references
maximum cut
0 references
fixed-parameter tractable
0 references
1-planar graphs
0 references
0.9726624
0 references
0.88825583
0 references
0.8867981
0 references
0.8838926
0 references
0.8834376
0 references
0.87896776
0 references
