Incremental algorithms for minimal length paths
From MaRDI portal
Publication:3988824
DOI10.1016/0196-6774(91)90036-XzbMath0751.68042WikidataQ61609669 ScholiaQ61609669MaRDI QIDQ3988824
Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni, Giorgio Ausiello
Publication date: 28 June 1992
Published in: Journal of Algorithms (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (25)
An incremental linear-time learning algorithm for the optimum-path forest classifier ⋮ Semi-dynamic shortest paths and breadth-first search in digraphs ⋮ A survey on combinatorial optimization in dynamic environments ⋮ NC algorithms for dynamically solving the all pairs shortest paths problem and related problems ⋮ Dynamic shortest paths and transitive closure: algorithmic techniques and data structures ⋮ Anytime search in dynamic graphs ⋮ Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs ⋮ A fully dynamic algorithm for distributed shortest paths. ⋮ Unnamed Item ⋮ Average case analysis of fully dynamic connectivity for directed graphs ⋮ Average-Case Analysis of Online Topological Ordering ⋮ Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class ⋮ Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time ⋮ Dynamic algorithms for shortest paths in planar graphs ⋮ Incremental single-source shortest paths in digraphs with arbitrary positive arc weights ⋮ Average-case analysis of incremental topological ordering ⋮ Fully dynamic all pairs shortest paths with real edge weights ⋮ Disk-based shortest path discovery using distance index over large dynamic graphs ⋮ Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization ⋮ Progressive simplification of polygonal curves ⋮ A uniform approach to semi-dynamic problems on digraphs ⋮ Average case analysis of fully dynamic reachability for directed graphs ⋮ Semi-dynamic breadth-first search in digraphs ⋮ Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks ⋮ Lifelong planning \(\text{A}^*\)
This page was built for publication: Incremental algorithms for minimal length paths
