Dynamic Matching Algorithms Under Vertex Updates.
Hung LeLazar MilenkovicShay SolomonVirginia Vassilevska WilliamsPublished in: ITCS (2022)
Keyphrases
- data structure
- computational complexity
- optimization problems
- orders of magnitude
- theoretical analysis
- significant improvement
- insertions and deletions
- learning algorithm
- recently developed
- times faster
- pattern matching
- computationally efficient
- dynamic environments
- worst case
- computational cost
- relational databases
- feature selection