Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Svatopluk Poljak, Franz Rendl. Nonpolyhedral Relaxations of Graph-Bisection Problems. SIAM Journal on Optimization, 5(3):467-487, 1995. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Solving Graph Bisection Problems with Semidefinite ProgrammingStefan E. Karisch, Franz Rendl, Jens Clausen. informs, 12(3):177-191, 2000. [doi] Semidefinite programming relaxations for graph coloring and maximal clique problemsIgor Dukanovic, Franz Rendl. mp, 109(2-3):345-365, 2007. [doi]
The following publications are possibly variants of this publication: