"Finding a Maximum Cut of a Planar Graph in Polynomial Time."

F. Hadlock (1975)

> Home

Details and statistics

DOI: 10.1137/0204019

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Hadlock75
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Hadlock75
F. Hadlock:
Finding a Maximum Cut of a Planar Graph in Polynomial Time. SIAM J. Comput. 4(3): 221-225 (1975)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.