Sciweavers

74
Voted
ICALP
2010
Springer
15 years 10 days ago
Sparse Reliable Graph Backbones
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David...