Chapter 5 deals with partitioning problems, converting recursive functions to iterative functions (it's fun, I assure you), and more factorial and Fibonacci series implementations.
By means of Laplacian spectrum recursive bisection partitioning method, firstly the power network is partitioned into branch-cut form; then the branch-cut form is changed into node-split form.
利用基于拉普拉斯谱划分的递归二分法将电力网络进行支路切割，然后将支路切割转换为节点撕裂。
3
This paper proposes a novel spectral partitioning algorithm, viz. recursive spectral bisection, for weighted graph partitioning that models large scale distribution feeder reconfiguration problem.