NDLTD Global ETD Search
Return to search

Graph partitioning - a survey

Description

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.

Links & Downloads
  1. urn:nbn:de:swb:ch1-200501047
  2. 1619-7186
  3. https://monarch.qucosa.de/id/qucosa%3A18354
  4. https://monarch.qucosa.de/api/qucosa%3A18354/attachment/ATT-0/
  5. https://monarch.qucosa.de/api/qucosa%3A18354/attachment/ATT-1/
  6. https://monarch.qucosa.de/api/qucosa%3A18354/attachment/ATT-2/
Tags
info:eu-repo/classification/ddc/510
ddc:510
Graphentheorie
Partitionierung
mesh partitioning
multilevel graph partitioning
spectral bisection
Additional Fields
Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:18354
Date09 September 2005
CreatorsElsner, Ulrich
PublisherTechnische Universität Chemnitz
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typedoc-type:preprint, info:eu-repo/semantics/preprint, doc-type:Text
SourcePreprintreihe des Chemnitzer SFB 393
Rightsinfo:eu-repo/semantics/openAccess

Page generated in 0.0022 seconds