Fast-MCS: A Scalable Open-Source Tool to Find Minimal Cut Sets
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912913414946816 |
|---|---|
| author | Janardhanan, Shakthivelu Chen, Yaxuan Kellerer, Wolfgang Mas-Machuca, Carmen |
| author_facet | Janardhanan, Shakthivelu Chen, Yaxuan Kellerer, Wolfgang Mas-Machuca, Carmen |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_16686 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Fast-MCS: A Scalable Open-Source Tool to Find Minimal Cut Sets Janardhanan, Shakthivelu Chen, Yaxuan Kellerer, Wolfgang Mas-Machuca, Carmen Networking and Internet Architecture 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. |
| title | Fast-MCS: A Scalable Open-Source Tool to Find Minimal Cut Sets |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2602.16686 |