Graph partitioning and parallel computing

DOI10.1016/S0167-8191(00)00042-9zbMATH Open0953.68587OpenAlexW2060731555MaRDI QIDQ1583330FDOQ1583330

Authors: R. Smith 

Publication date: 26 October 2000

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00042-9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (4)

• Graph bisection revisited
• SDP relaxations for some combinatorial optimization problems
• An efficient semidefinite programming relaxation for the graph partition problem
• Semidefinite programming and eigenvalue bounds for the graph partition problem

This page was built for publication: Graph partitioning and parallel computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583330)