Approximating two-terminal network reliability

Weiming Feng; Yucheng Fu; Heng Guo

Approximating two-terminal network reliability

Data Structures and Algorithms 2026-08-03 v1

Authors: Weiming Feng , Yucheng Fu , Heng Guo

Abstract

We present a fully polynomial-time randomised approximation scheme (FPRAS) for the two-terminal reliability problem on general graphs, both directed and undirected. We also show that the complementary unreliability question is \BIS-hard. The key idea of the algorithm was discovered by GPT-5.6 Sol Ultra.

Cite

@article{arxiv.2608.02523,
  title  = {Approximating two-terminal network reliability},
  author = {Weiming Feng and Yucheng Fu and Heng Guo},
  journal= {arXiv preprint arXiv:2608.02523},
  year   = {2026}
}

Comments

31 pages 5 figures