Bounded incremental computation
From MaRDI portal
Publication:1919660
DOI10.1007/BFb0028290zbMath0921.68050OpenAlexW1499442191MaRDI QIDQ1919660
Publication date: 24 July 1996
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0028290
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
On competitive on-line algorithms for the dynamic priority-ordering problem, On the computational complexity of dynamic graph problems, Contraint-based combinators for local search, Decremental algorithm for adaptive routing incorporating traveler information, A fully dynamic algorithm for distributed shortest paths., A dynamic topological sort algorithm for directed acyclic graphs, Shortest-Path Algorithms and Dynamic Cost Changes, A simple tabu search for warehouse location
