106
click to vote
SIAMDM
2008
15 years 2 months ago
2008
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine...