Fault tolerant graphs, perfect hash functions and disjoint paths

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

Research output: Chapter in Book/Report/Conference proceedingConference 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: Oct 24 1992Oct 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

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fault tolerant graphs, perfect hash functions and disjoint paths'. Together they form a unique fingerprint.

  • Cite this

    Ajtai, M., Alon, N., Bruck, J., Cypher, R., Ho, C. T., Naor, M., & Szémeredi, 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