| Article ID: | iaor20082738 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 3 |
| Start Page Number: | 403 |
| End Page Number: | 408 |
| Publication Date: | May 2007 |
| Journal: | Operations Research Letters |
| Authors: | Croce F. Della, Paschos V.Th., Kaminski M.J. |
We study exact algorithms for the MAX-CUT problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time