|
|||||
|
|
An exact algorithm for MAX-CUT in sparse graphs |
|
| Authors: | F Della Croce VTh Paschos |
| Institution: | a D.A.I., Politecnico di Torino, Italy b RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854, USA c LAMSADE, CNRS UMR 7024 and UniversitéParis-Dauphine, France |
| Abstract: | 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 O*(2(1-(2/Δ))n). We also describe a MAX-CUT algorithm for general graphs. Its time complexity is O*(2mn/(m+n)). Both algorithms use polynomial space. |
| Keywords: | MAX-CUT Exact algorithm Sparse graphs |
| 本文献已被 ScienceDirect 等数据库收录！ | |