𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Network Failure Detection and Graph Connectivity

✍ Scribed by Kleinberg, Jon; Sandler, Mark; Slivkins, Aleksandrs

Book ID
118180889
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
245 KB
Volume
38
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Network Failure Detection and Graph Conn
Network Failure Detection and Graph Connectivity
✍ Kleinberg, Jon; Sandler, Mark; Slivkins, Aleksandrs πŸ“‚ Article πŸ“… 2008 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 245 KB

We consider a model for monitoring the connectivity of a network subject to node or edge failures. In particular, we are concerned with detecting Β£ Β₯Β€ §¦ Β© -failures: events in which an adversary deletes up to Β¨network elements (nodes or edges), after which there are two sets of nodes and , each at

GRAPH CONNECTIVITY ALGORITHM
GRAPH CONNECTIVITY ALGORITHM
✍ Joseph B. Frechen πŸ“‚ Article πŸ“… 1970 πŸ› John Wiley and Sons 🌐 English βš– 452 KB
Graphs with prescribed connectivity and
Graphs with prescribed connectivity and line graph connectivity
✍ Douglas Bauer; Ralph Tindell πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 118 KB

## Abstract Chartrand and Stewart have shown that the line graph of an __n__‐connected graph is itself __n__‐connected. This paper shows that for every pair of integers __m__ > __n__ > 1 there is a graph of point connectivity __n__ whose line graph has point connectivity __m__. The corresponding qu