- document
-
Brown, Jason I. (author), Kolokolnikov, Theodore (author), Kooij, Robert (author)We introduce two new methods for approximating the all-terminal reliability of undirected graphs. First, we introduce an edge removal process: remove edges at random, one at a time, until the graph becomes disconnected. We show that the expected number of edges thus removed is equal to (Formula presented.), where (Formula presented.) is the...journal article 2024