A simple polynomial time algorithm for max cut on laminar geometric intersection graphs (Q6604632)
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 simple polynomial time algorithm for max cut on laminar geometric intersection graphs |
scientific article; zbMATH DE number 7912928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple polynomial time algorithm for max cut on laminar geometric intersection graphs |
scientific article; zbMATH DE number 7912928 |
Statements
A simple polynomial time algorithm for max cut on laminar geometric intersection graphs (English)
0 references
12 September 2024
0 references
geometric intersection graphs
0 references
max cut
0 references
vertical ray shooting
0 references
