Reliability evaluation is a useful tool for network performance demonstration, and therefore has become an increasingly relevant task in network design and operation. The multistate minimal cut (called d-MC for short) method is a popular algorithm for reliability evaluation of multistate flow networks. This article focuses on d-MC problem, and presents some new results to improve its solution. Grounded on the newly obtained results, an algorithm is proposed to find d-MCs, together with discussions on its time complexity that compares favorably with the existing methods. An illustration of the presented algorithm is provided by solving a simple example. Furthermore, numerical experiments and a case study are conducted to demonstrate the advantage and the utility of the proposed algorithm, respectively.

中文翻译：

---

多态最小割问题的一种新求解算法

可靠性评估是网络性能演示的有用工具，因此已成为网络设计和运营中越来越重要的任务。多态最小割（简称 d-MC）方法是一种流行的多态流网络可靠性评估算法。本文重点讨论 d-MC 问题，并提出了一些新结果以改进其解决方案。基于新获得的结果，提出了一种寻找 d-MC 的算法，并讨论了其与现有方法相比的时间复杂度。通过解决一个简单的例子来说明所提出的算法。此外，进行了数值实验和案例研究，以分别证明所提出算法的优势和实用性。