Finding a Maximum Cut of a Planar Graph in Polynomial Time (Q4083698)
From MaRDI portal
scientific article; zbMATH DE number 3501522
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a Maximum Cut of a Planar Graph in Polynomial Time |
scientific article; zbMATH DE number 3501522 |
Statements
Finding a Maximum Cut of a Planar Graph in Polynomial Time (English)
0 references
1975
0 references
