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
Published in:
Circuits and Systems, IEEE Transactions on
(Volume:24
,
Issue:
12
)
Date of Publication: Dec 1977