NIST

graph partition

(classic problem)

Definition: Partition the vertices while keeping the cost of spanning edges low.

Aggregate child (... is a part of or used in me.)
graph.

Author: PEB

Implementation

(C++) explanation of problem with links to implementations. METIS is a set of programs for partitioning graphs, etc.
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 3 December 2007.
HTML page formatted Tue Dec 6 16:16:32 2011.

Cite this as:
Paul E. Black, "graph partition", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 3 December 2007. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/graphPartition.html

to NIST home page