𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Implementing efficient graphs in connection networks

✍ Scribed by Ruben Juarez, Rajnish Kumar

Book ID
120746840
Publisher
Springer
Year
2012
Tongue
English
Weight
952 KB
Volume
54
Category
Article
ISSN
0938-2259

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient Graph Rewriting and Its Implem
Efficient Graph Rewriting and Its Implementation
✍ Heiko DΓΆrr (eds.) πŸ“‚ Library πŸ“… 1995 πŸ› Springer 🌐 English βš– 2 MB

This book presents two major research results on the fast implementation of graph rewriting systems (GRS). First, it explores the class of so-called UBS-GRS, where the complexity of a rewriting step is linear instead of NP, showing for example that visual programming is possible by UBS graph rewriti

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
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