MIT
97
The Problem
lInput:
»Graph G with n vertices
»Edge failure probabilities
–For exposition, fix a single p
lOutput:
»FAIL(p): probability G is disconnected by edge failures