Finding a Maximum Cut of a Planar Graph in Polynomial Time (1975)

by F O Hadlock
Venue:Siam J. Computing