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
\theta (nb)
, where
n
and
b
are the number of nodes and branches of the input graph, respectively. Experimental results show that our algorithm is highly efficient and yields near optimal solutions.