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 15 July 2019.
HTML page formatted Mon Jul 15 12:55:43 2019.

Cite this as:
Paul E. Black, "graph partition", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 July 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/graphPartition.html