Hager, William W.; Hungerford, James T. - In: European Journal of Operational Research 240 (2015) 2, pp. 328-337
Four NP-hard optimization problems on graphs are studied: The vertex separator problem, the edge separator problem, the maximum clique problem, and the maximum independent set problem. We show that the vertex separator problem is equivalent to a continuous bilinear quadratic program. This...