Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

RSA
2008

favoriteEmaildiscussreport

69views more RSA 2008»

Local resilience of graphs

13 years 3 months ago

Local resilience of graphs

Download www.math.ucla.edu

: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (locally) to destroy P. Estimating the resilience leads to many new and challenging problems. Here we focus on random and pseudorandom graphs and prove several sharp results.

Benny Sudakov, Van H. Vu

Real-time Traffic

Graph Resilience | Resilience | RSA 2008 | Systematic Study |

claim paper

Related Content

» Local resilience of almost spanning trees in random graphs

» On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs

» Semiautonomous networks Network resilience and adaptive trees

» BotGrep Finding P2P Bots with Structured Graph Analysis

» Analyzing the Resilience of Complex Supply Network Topologies Against Random and Targeted ...

» Internet resiliency to attacks and failures under BGP policy routing

» Resilient Localization for Sensor Networks in Outdoor Environments

» Localization ErrorResilient Geographic Routing for Wireless Sensor Networks

» Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks

Post Info
More Details (n/a)

Added	28 Dec 2010
Updated	28 Dec 2010
Type	Journal
Year	2008
Where	RSA
Authors	Benny Sudakov, Van H. Vu

Comments (0)