TY - GEN
T1 - Fault tolerant graphs, perfect hash functions and disjoint paths
AU - Ajtai, M.
AU - Alon, N.
AU - Bruck, J.
AU - Cypher, R.
AU - Ho, C. T.
AU - Naor, M.
AU - Szémeredi, E.
N1 - Publisher Copyright:
© 1992 IEEE.
PY - 1992
Y1 - 1992
N2 - Given a graph G on n nodes the authors say that a graph T on n + k nodes is a k-fault tolerant version of G, if one can embed G in any n node induced subgraph of T. Thus T can sustain k faults and still emulate G without any performance degradation. They show that for a wide range of values of n, k and d, for any graph on n nodes with maximum degree d there is a k-fault tolerant graph with maximum degree O(kd). They provide lower bounds as well: there are graphs G with maximum degree d such that any k-fault tolerant version of them has maximum degree at least Omega (d square root k).
AB - Given a graph G on n nodes the authors say that a graph T on n + k nodes is a k-fault tolerant version of G, if one can embed G in any n node induced subgraph of T. Thus T can sustain k faults and still emulate G without any performance degradation. They show that for a wide range of values of n, k and d, for any graph on n nodes with maximum degree d there is a k-fault tolerant graph with maximum degree O(kd). They provide lower bounds as well: there are graphs G with maximum degree d such that any k-fault tolerant version of them has maximum degree at least Omega (d square root k).
UR - http://www.scopus.com/inward/record.url?scp=79952398316&partnerID=8YFLogxK
U2 - 10.1109/SFCS.1992.267781
DO - 10.1109/SFCS.1992.267781
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:79952398316
T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
SP - 693
EP - 702
BT - Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
PB - IEEE Computer Society
Y2 - 24 October 1992 through 27 October 1992
ER -