TY - GEN

T1 - Sparse reliable graph backbones

AU - Chechik, Shiri

AU - Emek, Yuval

AU - Patt-Shamir, Boaz

AU - Peleg, David

N1 - Funding Information:
E-mail address: boaz@eng.tau.ac.il (B. Patt-Shamir). 1 Supported in part by Israel Science Foundation (grant 1372/09) and by the Israel Ministry of Science and Technology. 2 Supported in part by the Israel Ministry of Science and Technology.

PY - 2010

Y1 - 2010

N2 - Given a connected graph G and a failure probability p(e) for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independently with probability p(e). In this paper it is shown that every n-vertex graph contains a sparse backbone, i.e., a spanning subgraph with O(n logn) edges whose reliability is at least (1-n -Ω(1)) times that of G. Moreover, for any pair of vertices s, t in G, the (s,t)-reliability of the backbone, namely, the probability that s and t remain connected, is also at least (1-n -Ω(1)) times that of G. Our proof is based on a polynomial time randomized algorithm for constructing the backbone. In addition, it is shown that the constructed backbone has nearly the same Tutte polynomial as the original graph (in the quarter-plane x ≥ 1, y>1), and hence the graph and its backbone share many additional features encoded by the Tutte polynomial.

AB - Given a connected graph G and a failure probability p(e) for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independently with probability p(e). In this paper it is shown that every n-vertex graph contains a sparse backbone, i.e., a spanning subgraph with O(n logn) edges whose reliability is at least (1-n -Ω(1)) times that of G. Moreover, for any pair of vertices s, t in G, the (s,t)-reliability of the backbone, namely, the probability that s and t remain connected, is also at least (1-n -Ω(1)) times that of G. Our proof is based on a polynomial time randomized algorithm for constructing the backbone. In addition, it is shown that the constructed backbone has nearly the same Tutte polynomial as the original graph (in the quarter-plane x ≥ 1, y>1), and hence the graph and its backbone share many additional features encoded by the Tutte polynomial.

KW - Tutte polynomial

KW - network reliability

KW - sparse subgraphs

UR - http://www.scopus.com/inward/record.url?scp=77955310676&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14162-1_22

DO - 10.1007/978-3-642-14162-1_22

M3 - פרסום בספר כנס

AN - SCOPUS:77955310676

SN - 3642141617

SN - 9783642141614

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 261

EP - 272

BT - Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings

Y2 - 6 July 2010 through 10 July 2010

ER -