Many problems appearing in scientific computing
and other areas can be formulated as a graph
partitioning problems. Examples include data
distribution for parallel computers, decomposition
of sparse matrices and VLSI-design.
In this survey we present the graph partitioning
problem, describe some applications and introduce
many of the algorithms used to solve the problem.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:swb:ch1-200501047 |
| Date | 09 September 2005 |
| Creators | Elsner, Ulrich |
| Contributors | TU Chemnitz, SFB 393 |
| Publisher | Universitätsbibliothek Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint |
| Format | application/pdf, application/postscript, text/plain, application/zip |
| Source | Preprintreihe des Chemnitzer SFB 393 |
Page generated in 0.0059 seconds