A polynomial algorithm for the max-cut problem on graphs without long odd cycles
| Author: | Martin GrötschelGND, George L. Nemhauser |
|---|---|
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/14453 |
| ISSN: | 1436-4646OPAC |
| Parent Title (English): | Mathematical Programming |
| Publisher: | Springer |
| Place of publication: | Berlin |
| Type: | Article |
| Language: | English |
| Year of first Publication: | 1984 |
| Release Date: | 2017/07/21 |
| Volume: | 29 |
| Issue: | 1 |
| First Page: | 28 |
| Last Page: | 40 |
| DOI: | https://doi.org/10.1007/BF02591727 |
| Institutes: | Mathematisch-Naturwissenschaftlich-Technische Fakultät |
| Mathematisch-Naturwissenschaftlich-Technische Fakultät / Institut für Mathematik |
