The forgiving graph: a distributed data structure for low stretch under adversarial attack

DOI10.1007/s00446-012-0160-1zbMath1448.68106arXiv0902.2501OpenAlexW1972919351MaRDI QIDQ1938375

Thomas P. Hayes, Jared Saia, Amitabh Trehan

Publication date: 4 February 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.2501

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Distributed systems (68M14)

Related Items (4)

DEX: self-healing expanders ⋮ Compact routing messages in self-healing trees ⋮ Towards a universal approach for the finite departure problem in overlay networks ⋮ Towards a Universal Approach for the Finite Departure Problem in Overlay Networks

Cites Work

• Unnamed Item
• The forgiving tree
• Set reconciliation with nearly optimal communication complexity
• Know thy neighbor's neighbor
• The forgiving graph
• Building Optimal Binary Search Trees from Sorted Values in O(N) Time

This page was built for publication: The forgiving graph: a distributed data structure for low stretch under adversarial attack