A heuristic algorithm for power-network clustering
暂无分享,去创建一个
[1] Kenneth M. Hall. An r-Dimensional Quadratic Placement Algorithm , 1970 .
[2] John A. Hartigan,et al. Clustering Algorithms , 1975 .
[3] N. Muller,et al. A sparse eigenvalue-based approach for partitioning power networks , 1992 .
[4] Charles M. Fiduccia,et al. A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.
[5] E. Barnes. An algorithm for partitioning the nodes of a graph , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[6] Leon O. Chua,et al. An efficient heuristic cluster algorithm for tearing large-scale networks , 1977 .
[7] Eugene L. Lawler,et al. Cutsets and partitions of hypergraphs , 1973, Networks.
[8] Vincent Kanade,et al. Clustering Algorithms , 2021, Wireless RF Energy Transfer in the Massive IoT Era.
[9] S.,et al. An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .
[10] S. W. Hadley,et al. A Gomory-Hu cut tree representation of a netlist partitioning problem , 1990 .
[11] M. A. Laughton,et al. Cluster analysis of power-system networks for array processing solutions , 1985 .