一个新的有效的图的最小割集扫描算法
A novel and efficient algorithm for scanning all minimal cutsets of a graph
摘要：
本文提出了一种新的算法，用于枚举和列出给定图的所有最小割集。该问题是NP-难的。我们使用一个给定的图的连通性，开发一个算法，降低了复杂性，找到所有的割集。我们使用宽度优先搜索（BFS）的方法结合边缘收缩开发的算法。我们引入了枢轴顶点和可吸收簇的概念，并使用它们来开发一个增强的递归收缩算法。该算法的复杂度与割集的数目成正比。我们目前的仿真结果，我们所提出的算法与现有的方法的性能进行比较。
英文摘要：
We propose a novel algorithm for enumerating and listing all minimal cutsets of a given graph. It is known that this problem is NP-hard. We use connectivity properties of a given graph to develop an algorithm with reduced complexity for finding all its cutsets. We use breadth first search (BFS) method in conjunction with edge contraction to develop the algorithm. We introduce the concepts of a pivot vertex and absorbable clusters and use them to develop an enhanced recursive contraction algorithm. The complexity of the proposed algorithm is proportionate to the number of cutsets. We present simulation results to compare the performance of our proposed algorithm with those of existing methods.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
