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.

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