Finding a Maximum Cut of a Planar Graph in Polynomial Time (Q4083698): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 15:09, 5 March 2024
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
