A space saving trick for directed dynamic transitive closure and shortest path algorithms
From MaRDI portal
Recommendations
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
- Space-efficient algorithms for reachability in directed geometric graphs
- Improving Space Efficiency With Path Length Prediction for Finding k Shortest Simple Paths
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster
- Space-efficient fully dynamic DFS in undirected graphs
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
- Solving shortest paths efficiently on nearly acyclic directed graphs
- Shortest path algorithms for nearly acyclic directed graphs
Cited in
(7)- Space saving by dynamic algebraization based on tree-depth
- Fully dynamic all pairs shortest paths with real edge weights
- Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
- Design of algorithms for spatial-time reduction complexity of dynamic programming
- Space-efficient algorithms for reachability in directed geometric graphs
- Recent advances in fully dynamic graph algorithms (invited talk)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
This page was built for publication: A space saving trick for directed dynamic transitive closure and shortest path algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553236)
