Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time”

✍ Scribed by Aoshima, K.; Iri, M.

• Book ID: 118170115
• Publisher: Society for Industrial and Applied Mathematics
• Year: 1977
• Tongue: English
• Weight: 170 KB
• Volume: 6
• Category: Article
• ISSN: 0097-5397
• DOI: 10.1137/0206007