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 Black.

Entry modified 2 September 2014.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "graph partition", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/graphPartition.html