A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem
Year: 1998
Type: preprint
Abstract: The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability.
Source: arXiv (Cornell University)
Author: Karger, David R.
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1660816396