Definition: Partition the vertices while keeping the cost of spanning edges low.
Aggregate child (... is a part of or used in me.)
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 September 2014.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "graph partition", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/graphPartition.html