An Efficient Heuristic Cluster Algorithm for Tearing Large-Scale Networks.

摘要

An efficient heuristic algorithm for solving a cluster problem associated with the tearing of an undirected graph is presented via the concept of a contour tableau. The required computation time is shown to be bounded by O(nb), where n and b are the number of nodes and branches of the input graph, respectively. Experimental results show that the algorithm is highly efficient and yields near optimal solutions. (Author)