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