An improved lower bound on the max flow of postoutage network configurations

An improved lower bound is derived for the maximal flow of networks subject to edge failures. The bound is obtained by computing the max flow of a selected subnetwork around an edge that fails; hence, solution of the entire network can be avoided. The result is useful for the vulnerability analysis of flow networks.