Finding a Maximum Cut of a Planar Graph in Polynomial Time (Q4083698): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0204019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073705438 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:02, 19 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
