scientific article; zbMATH DE number 871917
From MaRDI portal
Publication:4875188
zbMATH Open0848.68047MaRDI QIDQ4875188FDOQ4875188
Alberto Marchetti-Spaccamela, Daniele Frigioni, Umberto Nanni
Publication date: 28 April 1996
Title of this publication is not available (Why is that?)
Cited In (8)
- Semi-dynamic breadth-first search in digraphs
- Lifelong planning \(\text{A}^*\)
- A single-source shortest path algorithm for dynamic graphs
- A uniform approach to semi-dynamic problems on digraphs
- Improved algorithms for dynamic shortest paths
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Anytime search in dynamic graphs
- Semi-dynamic shortest paths and breadth-first search in digraphs
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 👍 👎
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)
