Graph bipartitioning problem

Wuwell Liao
Phys. Rev. Lett. 59, 1625 – Published 12 October 1987
PDFExport Citation

Abstract

Replica-symmetric solutions of the graph-bipartitioning problem with finite connectivity are presented. With the constraint sumi=1NSi=0 strictly enforced, another solution can be obtained, which gives a lower cost function than that given by the spin-glass solution. It is believed that this new solution is currently the best candidate for the true solution of the graph-bipartitioning problem.

  • Received 11 May 1987

DOI:https://doi.org/10.1103/PhysRevLett.59.1625

©1987 American Physical Society

Authors & Affiliations

Wuwell Liao

  • Physics Department, Princeton University, Princeton, New Jersey 08544

References (Subscription Required)

Click to Expand
Issue

Vol. 59, Iss. 15 — 12 October 1987

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×