scientific article; zbMATH DE number 7204525
From MaRDI portal
Publication:5111404
DOI10.4230/LIPIcs.ICALP.2017.73zbMath1441.68166arXiv1703.10293MaRDI QIDQ5111404
Fabrizio Grandoni, Greg Bodwin, Merav Parter, Virginia Vassilevska Williams
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1703.10293
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (8)
Efficient Oracles and Routing Schemes for Replacement Paths ⋮ Blackout-tolerant temporal spanners ⋮ Unnamed Item ⋮ An efficient strongly connected components algorithm in the fault tolerant model ⋮ Graph spanners: a tutorial review ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees ⋮ Sparse Weight Tolerant Subgraph for Single Source Shortest Path ⋮ New Results on Linear Size Distance Preservers
This page was built for publication:
