Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A polynomial algorithm for the max-cut problem on graphs without long odd ..."

Martin Grötschel, George L. Nemhauser (1984)

> Home

Details and statistics

DOI: 10.1007/BF02591727

access: closed

type: Journal Article

metadata version: 2020-05-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/GrotschelN84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/GrotschelN84
Martin Grötschel, George L. Nemhauser:
A polynomial algorithm for the max-cut problem on graphs without long odd cycles. Math. Program. 29(1): 28-40 (1984)

a service of

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.