Answers are grounded in this paper and cite their sources.
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θ (nb), wherenandbare 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.
No takes yet. Share an insight, caveat, or question.
Sangiovanni‐Vincentelli et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: