Skip to main content
Conference Proceedings

A parallel graph partitioning algorithm for a message-passing multiprocessor

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 297 LNCS 498-513
DOI: 10.1007/3-540-18991-2_29
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Gilbert, J. R., & Zmijewski, E. (1988). A parallel graph partitioning algorithm for a message-passing multiprocessor. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 297 LNCS, pp. 498–513). Springer Verlag. https://doi.org/10.1007/3-540-18991-2_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free