scientific article; zbMATH DE number 7051219

zbMath1421.68121MaRDI QIDQ4633861

Ran Duan, Seth Pettie

Publication date: 6 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=1496826

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Distance in graphs (05C12) Data structures (68P05) Connectivity (05C40)

Related Items

Efficient Oracles and Routing Schemes for Replacement Paths ⋮ Unnamed Item ⋮ Compact distance oracles with large sensitivity and low stretch ⋮ Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal ⋮ Deterministic Fault-Tolerant Connectivity Labeling Scheme ⋮ An efficient strongly connected components algorithm in the fault tolerant model ⋮ Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. ⋮ Improved distance sensitivity oracles with subcubic preprocessing time ⋮ Fault-tolerant approximate shortest-path trees ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees ⋮ Incremental distance products via faulty shortest paths ⋮ Sparse Weight Tolerant Subgraph for Single Source Shortest Path ⋮ Unnamed Item ⋮ Unnamed Item