Fully dynamic shortest paths in digraphs with arbitrary arc weights
From MaRDI portal
Publication:4820906
DOI10.1016/S0196-6774(03)00082-8zbMATH Open1064.68068MaRDI QIDQ4820906FDOQ4820906
Authors: Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni 
Publication date: 1 October 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Recommendations
Cited In (15)
- Title not available (Why is that?)
- Shortest paths in a diagraph with an underestimated arc weight
- Dynamically maintaining shortest path trees under batches of updates
- Fully dynamic update of arc-flags
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Partially dynamic single-source shortest paths on digraphs with positive weights
- Anytime search in dynamic graphs
- Single backup table schemes for shortest-path routing
- Semi-dynamic shortest paths and breadth-first search in digraphs
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
- Labeled shortest paths in digraphs with negative and positive edge weights
- Improved dynamic graph coloring
- A dynamic topological sort algorithm for directed acyclic graphs
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
This page was built for publication: Fully dynamic shortest paths in digraphs with arbitrary arc weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820906)
