scientific article; zbMATH DE number 5764802

MaRDI QIDQ3579391zbMATH OpenFDO

Authors Aaron Bernstein, David R. Karger

Publication date 6 August 2010

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(13)

• Improved distance sensitivity oracles with subcubic preprocessing time
• Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
• Compact distance oracles with large sensitivity and low stretch
• Approximate distance sensitivity oracles in subquadratic space
• Approximate distance sensitivity oracles in subquadratic space
• \(f\)-sensitivity distance oracles and routing schemes
• Near optimal algorithm for fault tolerant distance oracle and single source replacement path problem
• Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
• Fault-tolerant ST-diameter oracles
• Fault-tolerant labeling and compact routing schemes
• Undirected 3-fault replacement path in nearly cubic time
• Fault-tolerant approximate distance oracles with a source set
• Incremental distance products via faulty shortest paths

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579391)