Searching for "Dynamization of Decomposable Searching Problems." – sorted by Relevance.
-
Dynamic Algorithms in Computational Geometry
- to a given query point) is decomposable. Dynamic data structures for a decomposable search problem can
- Cited by 64 (9 self) – Add To MetaCart

