scientific article; zbMATH DE number 871917
From MaRDI portal
Publication:4875188
Recommendations
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Semidynamic algorithms for maintaining single-source shortest path trees
- Fully dynamic shortest paths in digraphs with arbitrary arc weights
- Improved algorithms for dynamic shortest paths
- Single-source shortest paths and strong connectivity in dynamic planar graphs
Cited in
(11)- Semi-dynamic shortest paths and breadth-first search in digraphs
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Improved algorithms for dynamic shortest paths
- Power balance and apportionment algorithms for the United States Congress
- Semi-dynamic breadth-first search in digraphs
- A single-source shortest path algorithm for dynamic graphs
- Fully dynamic shortest paths in digraphs with arbitrary arc weights
- Lifelong planning \(\text{A}^*\)
- A uniform approach to semi-dynamic problems on digraphs
- Anytime search in dynamic graphs
- Dynamically maintaining shortest path trees under batches of updates
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 Q4875188)
