Some Lattice-Theoretic Tools for Network Reliability Analysis

The computation of K-terminal reliability for a graph is an intractable problem, and polynomially bounded algorithms are known for very limited classes of graphs only. This paper presents lattice-theoretic speed-up techniques for existing algorithmic ideas.