Finding a target subnetwork in sparse networks with random faults

  • Fraigniaud P
  • Kenyon C
  • Pelc A
  • 4


    Mendeley users who have this article in their library.
  • 3


    Citations of this article.


Given a network G=(V, E) we look for sparse extensions G*= (V*, E*) of G with |V*| ε{lunate} O(|V|) and such that if nodes of G*fail independently with constant probability p, G*almost certainly contains a fault-free isomorphic copy of G. © 1993.

Author-supplied keywords

  • Fault-tolerance
  • Random graph

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Pierre Fraigniaud

  • Claire Kenyon

  • Andrzej Pelc

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free