Finding a target subnetwork in sparse networks with random faults

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Fraigniaud, P., Kenyon, C., & Pelc, A. (1993). Finding a target subnetwork in sparse networks with random faults. Information Processing Letters, 48(6), 297–303. https://doi.org/10.1016/0020-0190(93)90172-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free