Fault-tolerant compact routing schemes for general graphs

DOI10.1016/j.ic.2012.10.009zbMath1267.68057OpenAlexW2135290460MaRDI QIDQ1951569

Shiri Chechik

Publication date: 6 June 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2012.10.009

zbMATH Keywords

fault-tolerancecompact routingforbidden sets

Mathematics Subject Classification ID

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 (4)

Efficient Oracles and Routing Schemes for Replacement Paths ⋮ Compact routing messages in self-healing trees ⋮ Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal ⋮ An efficient strongly connected components algorithm in the fault tolerant model

This page was built for publication: Fault-tolerant compact routing schemes for general graphs