This paper reviews a dynamic programming procedure for the partitioning of connected graphs with integer-weighted nodes and positive valued edges. The upper bound on the number of feasible partitions generated using this technique is shown to grow factorially in the number of graph nodes. The use of graph properties is then introduced to reduce the number of feasible partitions generated in the determination of the optimal partition. Depending upon the structure of the graph, the use of these properties can cause a significant reduction in the computation time and storage space required to partition the graph.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.