A network is represented as a graph consisting of nodes and edges. A cut set for a source-destination pair in a network is a set of elements that, when failed, cause the source-destination pair to lose connectivity. A Minimal Cut Set (MCS) is a cut set that cannot be further reduced while maintaining its status as a cut set. MCSs are crucial in identifying the critical elements in the network that have the most significant impact on failure. This work introduces Fast-MCS, an open-source, scalable tool for evaluating MCSs in large, complex networks. Additionally, we compare the computation time of Fast-MCS with the state-of-the-art.

翻译：网络可表示为由节点和边组成的图。网络中源-目的地对的割集是指当其中元素失效时会导致该源-目的地对失去连通性的元素集合。最小割集（MCS）是指无法在保持其割集性质的前提下进一步缩减的割集。MCS对于识别网络中那些对故障影响最为显著的关键元素至关重要。本文介绍了Fast-MCS，这是一个用于评估大型复杂网络中MCS的开源、可扩展工具。此外，我们还将Fast-MCS的计算时间与当前最先进的方法进行了比较。