Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time” (Q4117837): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:10, 6 February 2024
scientific article; zbMATH DE number 3542435
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time” |
scientific article; zbMATH DE number 3542435 |
Statements
Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time” (English)
0 references
1977
0 references
