scientific article; zbMATH DE number 1306899

zbMath0938.68919MaRDI QIDQ4252752

Valerie King, Monika R. Henzinger

Publication date: 26 April 2000

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Fast dynamic transitive closure with lookahead ⋮ Dynamic shortest paths and transitive closure: algorithmic techniques and data structures ⋮ Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs ⋮ Reachability preserving compression for dynamic graph ⋮ Incremental recomputation in local languages. ⋮ On dynamic shortest paths problems ⋮ Mantaining dynamic matrices for fully dynamic transitive closure ⋮ Incremental single-source shortest paths in digraphs with arbitrary positive arc weights ⋮ Maintaining dynamic minimum spanning trees: an experimental study ⋮ Fully dynamic all pairs shortest paths with real edge weights ⋮ Unnamed Item ⋮ A fully dynamic algorithm for maintaining the transitive closure ⋮ Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs ⋮ A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time ⋮ Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs ⋮ Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths ⋮ Semi-dynamic breadth-first search in digraphs ⋮ Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks ⋮ Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time

This page was built for publication: