Fault-Tolerant Compact Routing Schemes for General Graphs
From MaRDI portal
Publication:3012912
DOI10.1007/978-3-642-22012-8_7zbMath1333.68208OpenAlexW2206859651MaRDI QIDQ3012912
Publication date: 7 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_7
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Cites Work
- Unnamed Item
- Compact Routing with Minimum Stretch
- Connectivity oracles for failure prone graphs
- Improved routing strategies with succinct tables
- Approximate distance oracles
- f-Sensitivity Distance Oracles and Routing Schemes
- Compact Forbidden-Set Routing
- Distributed Computing: A Locality-Sensitive Approach
- A trade-off between space and efficiency for routing tables
- Compact routing schemes with low stretch factor
- Optimal static range reporting in one dimension
- Forbidden-set distance labels for graphs of bounded doubling dimension
- Memory requirement for universal routing schemes
- Space-efficiency for routing schemes of stretch factor three