Fast-MCS: A Scalable Open-Source Tool to Find Minimal Cut Sets
Networking and Internet Architecture
2026-02-20 v2
Abstract
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.
Keywords
Cite
@article{arxiv.2602.16686,
title = {Fast-MCS: A Scalable Open-Source Tool to Find Minimal Cut Sets},
author = {Shakthivelu Janardhanan and Yaxuan Chen and Wolfgang Kellerer and Carmen Mas-Machuca},
journal= {arXiv preprint arXiv:2602.16686},
year = {2026}
}