Fault tolerant graphs, perfect hash functions and disjoint paths

M. Ajtai, N. Alon, J. Bruck, R. Cypher, C. T. Ho, M. Naor, E. Szemerédi

Research output: Conference contribution

23 Citations (Scopus)

Abstract

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).

Original languageEnglish
Title of host publicationProceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
PublisherIEEE Computer Society
Pages693-702
Number of pages10
ISBN (Electronic)0818629002
DOIs
Publication statusPublished - jan. 1 1992
Event33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States
Duration: okt. 24 1992okt. 27 1992

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume1992-October
ISSN (Print)0272-5428

Conference

Conference33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
CountryUnited States
CityPittsburgh
Period10/24/9210/27/92

Fingerprint

Hash functions
Degradation

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Ajtai, M., Alon, N., Bruck, J., Cypher, R., Ho, C. T., Naor, M., & Szemerédi, E. (1992). Fault tolerant graphs, perfect hash functions and disjoint paths. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 (pp. 693-702). [267781] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October). IEEE Computer Society. https://doi.org/10.1109/SFCS.1992.267781

Fault tolerant graphs, perfect hash functions and disjoint paths. / Ajtai, M.; Alon, N.; Bruck, J.; Cypher, R.; Ho, C. T.; Naor, M.; Szemerédi, E.

Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. p. 693-702 267781 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October).

Research output: Conference contribution

Ajtai, M, Alon, N, Bruck, J, Cypher, R, Ho, CT, Naor, M & Szemerédi, E 1992, Fault tolerant graphs, perfect hash functions and disjoint paths. in Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992., 267781, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 1992-October, IEEE Computer Society, pp. 693-702, 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992, Pittsburgh, United States, 10/24/92. https://doi.org/10.1109/SFCS.1992.267781
Ajtai M, Alon N, Bruck J, Cypher R, Ho CT, Naor M et al. Fault tolerant graphs, perfect hash functions and disjoint paths. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society. 1992. p. 693-702. 267781. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). https://doi.org/10.1109/SFCS.1992.267781
Ajtai, M. ; Alon, N. ; Bruck, J. ; Cypher, R. ; Ho, C. T. ; Naor, M. ; Szemerédi, E. / Fault tolerant graphs, perfect hash functions and disjoint paths. Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. pp. 693-702 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
@inproceedings{0bb417305ab342a98258cca2f336fab2,
title = "Fault tolerant graphs, perfect hash functions and disjoint paths",
abstract = "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).",
author = "M. Ajtai and N. Alon and J. Bruck and R. Cypher and Ho, {C. T.} and M. Naor and E. Szemer{\'e}di",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/SFCS.1992.267781",
language = "English",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "693--702",
booktitle = "Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992",

}

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 - Szemerédi, E.

PY - 1992/1/1

Y1 - 1992/1/1

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

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

U2 - 10.1109/SFCS.1992.267781

DO - 10.1109/SFCS.1992.267781

M3 - Conference contribution

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

ER -