Improved algorithms for constructing fault-tolerant spanners
From MaRDI portal
Publication:5956838
DOI10.1007/s00453-001-0075-xzbMath0998.68226MaRDI QIDQ5956838
Giri Narasimhan, Michiel H. M. Smid, Christos Levcopoulos
Publication date: 20 May 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0075-x
68W05: Nonnumerical algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Unnamed Item, Sometimes Reliable Spanners of Almost Linear Size., Vertex fault-tolerant spanners for weighted points in polygonal domains, Minimum weight Euclidean \((1+\varepsilon)\)-spanners, Reliable Spanners for Metric Spaces, Vertex Fault-Tolerant Geometric Spanners for Weighted Points, \( \delta \)-greedy \(t\)-spanner, Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies, Region-fault tolerant geometric spanners, Continuous Yao graphs, A spanner for the day after, Deformable spanners and applications