Skip to main content
Article thumbnail
Location of Repository

An efficient semidefinite programming relaxation for the graph partition problem

By R. Sotirov
Topics: graph partition, graph equipartition, matrix lifting, vector lifting, semidefinite
Year: 2012
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • http://www.optimization-online... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.