Partitioning of ECE schemes components based on modified graph coloring algorithm

One of the most important design problems - electronic computing equipment (ECE) schemes components partitioning problem is considered in the article. It belongs to the class of NP-hard problems. Statement of a partitioning problem and an optimization criterion are defined. A new approach for solving partitioning problem based on the modified graph coloring algorithm is suggested. The modified partitioning algorithm which provides obtained solutions of a specified accuracy in polynomial time is developed. A modified graph coloring heuristic is described. Authors suggested a procedure for the transition from colored subsets to specify parts of the partition. The program environment and computing experiment are implemented. The series of tests and experiments have allowed specifying theoretical estimations of partitioning algorithms running time. The running time of the algorithm is represented as O (n²).