2026/08/03 by Weiming Feng, Yucheng Fu, Heng Guo
Computer Science · #cs.DS
31 pages 5 figures
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.