Graph partitioning and parallel computing

DOI10.1016/S0167-8191(00)00042-9zbMath0953.68587OpenAlexW2060731555MaRDI QIDQ1583330

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

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

Related Items (4)

Graph bisection revisited ⋮ An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem ⋮ SDP Relaxations for Some Combinatorial Optimization Problems ⋮ Semidefinite programming and eigenvalue bounds for the graph partition problem

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