Graph Partitioning Algorithms with Applications to Scientific Computing

@incollection{citeulike:1731673, abstract = {Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a specified number of subsets such that few edges join two vertices in different subsets. Several new graph partitioning algorithms have been developed in the past few years, and we survey some of this activity. We...}, author = {Pothen, Alex }, booktitle = {Parallel Numerical Algorithms}, citeulike-article-id = {1731673}, editor = {Keyes, D. E. and Sameh, A. H. and Venkatakrishnan, V. }, keywords = {multilevel}, posted-at = {2007-10-05 20:07:53}, priority = {2}, publisher = {Kluwer Academic Press}, title = {Graph Partitioning Algorithms with Applications to Scientific Computing}, url = {http://citeseer.ist.psu.edu/pothen97graph.html}, year = {1995} }

TY - CHAP ID - citeulike:1731673 L3 - citeulike-article-id:1731673 TI - Graph Partitioning Algorithms with Applications to Scientific Computing T2 - Parallel Numerical Algorithms PB - Kluwer Academic Press N2 - Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a specified number of subsets such that few edges join two vertices in different subsets. Several new graph partitioning algorithms have been developed in the past few years, and we survey some of this activity. We... KW - multilevel AU - Pothen, Alex A2 - Keyes, DE A2 - Sameh, AH A2 - Venkatakrishnan, V PY - 1995/// UR - http://citeseer.ist.psu.edu/pothen97graph.html ER -